Referenced Items are not available for this document.
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
- Page(s):
- 1223 - 1227 vol.2
- Meeting Date :
- 10 Dec 1997-12 Dec 1997
- ISSN :
- 0191-2216
- Print ISBN:
- 0-7803-4187-2
- INSPEC Accession Number:
- 5850580
- Conference Location :
- San Diego, CA
- Digital Object Identifier :
- 10.1109/CDC.1997.657620
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
