By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tsu-Shuan Chang ; Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA ; Jian Yang ; Shih-Ho Wang

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

Published in:

Decision and Control, 1997., Proceedings of the 36th IEEE Conference on  (Volume:2 )

Date of Conference:

10-12 Dec 1997