An improvement of the Lagrangean relaxation approach for job shop scheduling: A dynamic programming method

IEEE Transactions on Robotics and Automation

Volumn 14, Issue 5, 1998, Pages 786-795

  Chen, Haoxun ^a   Chu, Chengbin ^b   Proth, Jean Marie ^c  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

^b UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^c INRIA   (France)

Author keywords

Decomposition; Dynamic programming; Lagrangean relaxation; Scheduling

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; LAGRANGE MULTIPLIERS; SCHEDULING;

LAGRANGEAN RELAXATION APPROACH;

COMPUTER AIDED MANUFACTURING;

EID: 0032186585     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.720354     Document Type: Article

References (27)

1. J. Adams, E. Balas, and D. Zawack, "The shifting bottleneck procedure for job shop scheduling," Manag. Sci., vol. 34, no. 3, pp. 391-401, 1988.
2. H. G. Campbell, R. A. Dudek, and M. L. Smith, "A heuristic algorithm for the n job, m machine sequencing problem," Manag. Sci., vol. 16, pp. B630-B637, 1970.
3. J. Carlier and E. Pinson, "An algorithm for solving the job-shop problem," Manag. Sci., vol. 35, pp. 164-176, 1989.
4. H. Chen, J. M. Proth, and B. Hu, "A scheduling framework based on Petri net modeling and sequential Lagrangean relaxation approach," in Proc. Rensselaer's 4th Int. Conf. Comput. Integrated Manufact. Automat. Technol., Rensselaer Polytechnic Institute, Troy, NY, Oct. 10-12, 1994.
5. C. S. Czerwinski and P. B. Luh, "An improved Lagrangean relaxation technique for job shop scheduling," in Proc. IEEE Conf. Decision Contr., 1992, vol. 1, pp. 771-776.
6. H. Fisher and G. L. Thompson, "Probabilistic learning combinations of local job-shop scheduling rules," in Industrial Scheduling, J. F. Muth and G. L. Thompson, Eds. Englewood Cliffs, NJ: Prentice-Hall, pp. 225-251, 1963.
7. M. L. Fisher, "Optimal solution of scheduling problems using Lagrange multipliers, part I," Oper. Res., vol. 21, pp. 1114-1127, 1973.
8. _, "A dual algorithm for the one-machine scheduling problem," Mathematical Programming, vol. 11, pp. 229-251, 1976.
9. S. C. Graves, "A review of production scheduling," Oper. Res., vol. 18, pp. 841-852, 1981.
10. N. G. Hall and M. E. Posner, " Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date," Oper. Res., vol. 39, pp. 836-846, 1991.
11. M. Held and R. M. Karp, "A dynamic programming approach to sequencing problems," J. Soc. Indust. Appl. Math., vol. 10, pp. 196-210, 1962.
12. D. J. Hoitomt, P. B. Luh, and K. R. Pattipati, "Job shop scheduling," in Proc. 1st Int. Conf. Automat. Technol., Taipei, Taiwan, R.O.C., 1990, pp. 565-574.
13. _, "A practical approach to job-shop scheduling problems," IEEE Trans. Robot. Automat., vol. 9, pp. 1-13, 1993.
14. B. J. Lageweg, J. K. Lenstra, and A. H. G. Rinnooy Kan, "Job shop scheduling by implicit enumeration," Manag. Sci., vol. 24, pp. 441-450, 1977.
15. _, "A general bounding scheme for the permutation flow-shop problem," Oper. Res., vol. 26, pp. 53-67, 1978.
16. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, "Sequencing and scheduling: Algorithm and complexity," in Handbooks in Operations Research and Management Science. Amsterdam, The Netherlands North-Holland, vol. 4, 1993.
17. P. B. Luh and D. Hoitomt, "Scheduling of manufacturing systems using the Lagrangean relaxation techniques," in Proc. IFAC Workshop Discrete Event Syst. Theory Appl., Shenyang, China, 1991.
18. P. B. Luh, D. J. Hoitomt, E. Max, and K. P. Pattipati, "Scheduling generation and reconfiguration for parallel machines," IEEE Trans. Robot. Automat., vol. 6, pp. 687-696, 1990.
19. I. H. Osman and C. N. Potts, "Simulated annealing for permutation flowshop scheduling," OMEGA Int. J. Manag. Sci., vol. 17, pp. 551-557, 1989.
20. B. T. Polyak, "Minimization of unsmooth functionals," USSR Comput. Math. Phys, vol. 9, pp. 14-29, 1969.
21. C. N. Potts and L. N. Van Wassenhove, "A branch and bound algorithm for the total weighted tardiness problem," Oper. Res., vol. 33, pp. 363-377, 1985.
22. _, "Programming and decomposition approaches for the single machine total tardiness problem," Euro. J. Oper. Res., vol. 32, pp. 405-414, 1987.
23. R. N. Tomastik and P. B. Luh, "The facet ascending algorithm for integer programming problems," in Proc. 32nd Conf. Decision Contr., San Antonio, TX, Dec. 1993, pp. 2880-2884.
24. _, "A reduced-complexity bundle method for maximizing concave nonsmooth functions," in Proc. 35th Conf. Decision Contr., Kobe, Japan, Dec. 1996, pp. 2114-2119.
25. P. J. M. Van Laarhoven, E. H. L. Aarts, and J. K. Lenstra, "Job shop scheduling by simulated annealing," Tech. Rep. OS-R8809, Ctr. for Math & Comput. Sci., Amsterdam, Holland, 1988.
26. J. Wang and P. B. Luh, "A combined Lagrangean relaxation relation and dynamic programming algorithm for job shop scheduling," in Proc. 5th Int. Conf. Comput. Integr. Manufact. Automat. Technol., Grenoble, France, May 1996, pp. 3-8.
27. J. Wang, P. B. Luh, and X. Zhao, "An optimization-based algorithm for job shop scheduling, J. Indian Acad. Sci. Compet. Manufact., 1997.