An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling

European Journal of Operational Research

Volumn 91, Issue 1, 1996, Pages 99-117

  He, Zesheng ^a   Yang, Taeyong ^a   Tiger, Andy ^a  

^a UNIVERSITY OF HOUSTON   (United States)

Author keywords

Heuristic; Job shop scheduling; Scheduling with due dates; Sequencing; Simulated annealing

Indexed keywords

EID: 0010844051     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00361-0     Document Type: Article

References (31)

1. Adam, N., and Surkis, J. (1977), "A comparison of capacity planning techniques in a job shop control systems", Management Science 23, 1011-1015.
2. Anderson, E.J., and Nyirenda, J.C, (1990), "Two new rules to minimize tardiness in a job shop", International Journal of Production Research 28, 2277-2292.
3. Baker, K.R. (1974), Introduction to Sequencing and Scheduling, Wiley, New York.
4. Baker, K.R. (1984), "Sequencing rules and due-date assignments in a job shop", Management Science 30, 1093-1104.
5. Baker, K.R., and Kanet, J.J. (1983), "Job shop scheduling with modified due dates", Journal of Operations Management 4, 11-21.
6. Bertrand, J.W.M. (1983), "The effect of workload dependent due-dates on job shop performance", Management Science 29, 799-816.
7. Carroll, D.C. (1965), "Heuristic sequencing of jobs with single and multiple components", Ph.D. Thesis, Sloan School of Management, MIT.
8. Conway, R.W. (1965), "Priority dispatching and job lateness in a job shop", Journal of Industrial Engineering 29, 228-237.
9. Du, J., and Leung, J.Y.T. (1990), "Minimizing total tardiness on one machine is NP-hard", Mathematics of Operations Research 15, 483-495.
10. Dumond, J., and Mabert, V.A. (1988), "Evaluating project scheduling and due date assignment procedures: An experimental analysis", Management Science 34, 101-118.
11. Eglese, R.W. (1990), "Simulated annealing: A tool for operational research", European Journal of Operational Research 46, 271-281.
12. Elvers, D.A. (1973), "Job shop dispatching rules using various delivery date setting criteria", Production and Inventory Management 4, 63-70.
13. Garey, M.R., and Johnson, D.S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA.
14. Garey, M.R., Johnson, D.S., and Sethi, R. (1976), "The complexity of flowshop and jobshop scheduling", Mathematics of Operations Research 1, 117-129.
15. Gonzalez, T., and Sahni, S. (1978), "Flowshop and jobshop schedules: Complexity and approximation", Operations Research 26, 36-52.
16. He, Z., Yang, T., and Deal, D.E. (1993), "A multiple-pass heuristic rule for job shop scheduling with due dates", International Journal of Production Research 31, 2677-2692.
17. Jeffcoat, D.E., and Bulfin, R.L. (1993), "Simulated annealing for resource-constrained scheduling", European Journal of Operational Research 70, 43-51.
18. Johnson, D.S., Aragon, C.R., McGeoch, L.A., and Schevon, C. (1989), "Optimization by simulated annealing: An experimental evaluation; Part I, Graph partitioning", Operations Research 37, 865-892.
19. Matsuo, H., Sun, C.J., and Sullivan, R.S. (1988), "A controlled search simulated annealing method for the general jobshop scheduling problem", Working Paper 03-04-88, Department of Management, the University of Texas at Austin.
20. Matsuo, H., Suh, C.J., and Sullivan, R.S. (1989), "A controlled search simulated annealing method for the single machine weighted tardiness problem", Annals of Operations Research 21, 85-108.
21. Ogbu, F.A., and Smith, D.K. (1990), "The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem", Computers & Operations Research 17, 243-253.
22. Osman, I. H., and Potts, C. N. (1989), "Simulated annealing for permutation flow-shop scheduling", OMEGA 17, 551-557.
23. Ragatz, G.L. and Mabert, V.A. (1984), "A simulation analysis of due date assignment rules", Journal of Operations Management 5, 27-36.
24. Van Laarhoven, P.J.M., and Aarts, E.H.L. (1987), Simulated Annealing: Theory and Applications, Reidel, Dordrecht.
25. Van Laarhoven, P.J.M., Aarts, E.H.L., and Lenstra, J.K. (1992), "Job shop scheduling by simulated annealing", Operations Research 40, 113-125.
26. Weeks, J.K. (1979), "A simulation study of predictable duedates", Management Science 25, 363-373.
27. Vepsalainen, A.P.J., and Morton, T. (1987), "Priority rules for job shops with weighted tardiness costs", Management Science 33, 1035-1047.
28. Yang, T., and Ignizio, J.P. (1987), "An algorithm for the scheduling of army battalion training exercises", Computers & Operations Research 14, 479-491.
29. Yang, T., He, Z., and Cho, K.K. (1993), "An effective heuristic algorithm for generalized job shop scheduling with due dates", accepted in Computers and Industrial Engineering.
30. Yang, T., Ignizio, J.P., and Deal, D.E. (1989), "An exchange heuristic for generalized job shop scheduling", Engineering Optimization 15, 83-96.
31. Yang, T., Ignizio, J.P., and Song, J. (1989), "An exchange heuristic algorithm for project scheduling with limited resources", Engineering Optimization 1, 189-205.