On the use of linear programming for manufacturing scheduling via Lagrangian relaxation

To use the Lagrangian relaxation approach for developing pragmatic manufacturing scheduling strategies, there is always a need for efficient algorithms to solve its associated nondifferentiable dual proble Chang (1996) showed one way to use linear programming (LP) to address this issue, by dealing with an equivalent LP problem for the dual problem. In this paper, we presented a different way to use the LP-based framework to find an exact optimizer for the dual problem. The scheduling for an IC sort and test floor is used as examples in our preliminary numerical results.