Scheduling Products with Bills of Materials using an Improved Lagrangian Relaxation Technique

IEEE Transactions on Robotics and Automation

Volumn 10, Issue 2, 1994, Pages 99-111

  Czerwinski, Christopher S ^a   Luh, Peter B ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSEMBLY; INVENTORY CONTROL; MANUFACTURE; MATHEMATICAL TECHNIQUES;

BILL OF MATERIALS; LAGRANGIAN RELAXATION TECHNIQUE; WORK IN PROCESS;

SCHEDULING;

EID: 0028413489     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.282535     Document Type: Article

References (16)

1. P. Camerini, L. Fratta, and F. Maffioli, “On improving relaxation methods by modified gradient techniques,” Mathematical Programming Study 3, Amsterdam, pp. 26–34, 1975.
2. C. S. Czerwinski and P. B. Luh, “An improved Lagrangian relaxation technique for job shop scheduling,” Proceedings of the 1992 IEEE Conference on Decision and Control, 1992.
3. S. C. Graves, “A review of production scheduling,” Operations Research, vol. 18, pp. 841–852, 1981.
4. J. Harhen, “MRP/MRP II,” in Computer-Aided Production Management, A. Rolstadas, Ed. Springer-Verlag, pp. 23–35, 1988.
5. D. Hoitomt, P. Luh, E. Max, and K. Pattipati, “Scheduling jobs with simple precedence constraints on parallel machines,” IEEE Control Systems Magazine, vol. 10, no. 1, pp. 34–40, 1990.
6. D. J. Hoitomt, P. B. Luh, and K. R. Pattipati, “Job shop scheduling,” Proceedings of the First International Conference on Automation Technology, Taipei, Taiwan, 1990, pp. 565-574; A revised version will appear in 1992 IEEE Transactions on Robotics and Automation.
7. S. Kim, and H. Ahn, “Convergence properties of the modified subgradient method of Camerini et al.,” Naval Research Logistics, vol. 37, pp. 961–966, 1990.
8. J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Bruckner, “Complexity of machine scheduling problems,” Annals of Discrete Mathematics, vol. 7, pp. 343–362, 1977.
9. D. G. Luenberger, Linear and Nonlinear Programming. Reading, MA: Addison-Wesley, 1984, pp. 243–246.
10. P. B. Luh, D. J. Hoitomt, E. Max, and K. R. Pattipati, “Schedule generation and reconfiguration for parallel machines,” IEEE Transactions on Robotics and Automation, vol. 6, no. 6, pp. 687–696, 1990.
11. K. N. McKay, F. R. Safayeni, and J. A. Buzacott, “Job-shop scheduling theory: What is relevant?” Interfaces, vol. 18, pp. 84–90, 1988.
12. S. Miyazaki, “Combined scheduling system for reducing job tardiness in a job shop,” International Journal of Production Research, vol. 19, no. 2, pp. 201–211.
13. G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization. New York: John Wiley & Sons, Inc., 1988, pp. 323–337.
14. N. Z. Shor, Minimization Methods for Non-Differentiable Functions. Berlin: Springer-Verlag, 1985, pp. 40–42.
15. R. Tomastik and P. B. Luh, “The facet ascending algorithm for integer programming problems” in Proceedings of the 32nd IEEE Conference on Decision and Control, San Antonio, Texas, December 1993, pp. 2880–2884.
16. K. P. White, Jr., “Advances in the theory and practice of scheduling,” in Advances in Industrial Systems, Control and Dynamic Systems, vol. 37, C. T. Leondes, Ed. San Diego, CA: Academic Press, Inc., 1990, pp. 115–158.