An effective meta-heuristic for no-wait job shops to minimize makespan

IEEE Transactions on Automation Science and Engineering

Volumn 9, Issue 1, 2012, Pages 189-198

  Zhu, Jie ^a   Li, Xiaoping ^b  

^a SOUTHEAST UNIVERSITY   (China)

^b Ministry of Education   (China)

Author keywords

Job shop; No wait; Sequencing; Timetabling

Indexed keywords

COMPUTATIONAL RESULTS; JOB SHOP; LOCAL SEARCH; MAKESPAN; MAKESPAN MINIMIZATION; METAHEURISTIC; NO-WAIT; NO-WAIT JOB SHOP PROBLEM; SEQUENCING; SEQUENCING PROBLEMS; STRONGLY NP-HARD; SUB-PROBLEMS; TIME-DIFFERENCES; TIMETABLING; TIMETABLING PROBLEM;

COMPUTATIONAL COMPLEXITY; SCHEDULING ALGORITHMS;

COMPUTATIONAL EFFICIENCY;

EID: 84855375383     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2011.2163305     Document Type: Article

References (28)

1. J. K. Lenstra and A. H. G. Rinnooy Kan, "Computational complexity of discrete optimization problems," Ann. Discrete Math., vol. 4, pp. 121-40, 1979.
2. J. Blazewicz, W. Domschke, and E. Pesch, "The job-shop- schedulingproblem: Conventional and new solution techniques," Eur. J. Oper. Res., vol. 93, pp. 1-33, 1996. (Pubitemid 126389264)
3. A. Jain and S. Meeran, "Deterministic job-shop-scheduling: Past, present and future," Eur. J. Oper. Res., vol. 113, no. 2, pp. 390-434, 1990.
4. W. Raaymakers and J. Hoogeveen, "Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing," Eur. J. Oper. Res., vol. 126, pp. 131-51, 2000.
5. C. Rajendran, "A no-wait flowshop scheduling heuristic to minimize makespan," J. Oper. Res. Soc., vol. 45, no. 4, pp. 472-8, 1994.
6. D. A. Wismer, "Solution of the flowshop scheduling-problem with no intermediate queues," Oper. Res., vol. 20, pp. 689-97, 1972.
7. S. Reddi and C. Ramamoorthy, "A scheduling-problem," Oper. Res. Quart., vol. 24, pp. 441-6, 1973.
8. I. Ovacik and R. Uzsoy, Decomposition Method for Complex Factory Scheduling Problems. Dordrecht, The Netherlands: Kluwer Academic Publishing, 1997.
9. P. Dinh-Nguyen and K. Andreas, "Surgical case scheduling as a generalized job shop scheduling problem," Eur. J. Oper. Res., vol. 185, pp. 1011-25, 2008.
10. J. Grabowski and J. Pempera, "Sequencing of jobs in some production system," Eur. J. Oper. Res., vol. 125, pp. 535-50, 2000.
11. N. G. Hall and C. Sriskandarajah, "A survey of machine scheduling problems with blocking and no-wait in process," Oper. Res., vol. 44, pp. 510-25, 1996. (Pubitemid 126669516)
12. S. Sahni and Y. Cho, "Complexity of scheduling shops with no-wait in process," Math. Oper. Res., vol. 4, pp. 448-57, 1979. (Pubitemid 11425792)
13. G. J. Woeginger, "Inapproximability results for no-wait job shop scheduling," Oper. Res. Lett., vol. 32, pp. 320-5, 2004.
14. N. Bansal, M. Mahdian, and M. Sviridenko, "Minimizing makespan in no-wait job shops," Math. Oper. Res., vol. 30, no. 4, pp. 817-31, 2005. (Pubitemid 43134178)
15. C. Meloni, D. Pacciarelli, and M. Pranzo, "A rollout metaheuristic for job shop scheduling problems," Ann. Oper. Res., vol. 131, pp. 215-35, 2004. (Pubitemid 39187381)
16. R. Macchiaroli, S. Mole, and S. Riemma, "Modelling and optimization of industrial manufacturing processes subject to no-wait constraints," Int. J. Prod. Res., vol. 37, no. 11, pp. 2585-607, 1999.
17. A. Mascis and D. Pacciarelli, "Job shop scheduling with blocking and no-wait constraints," Eur. J. Oper. Res., vol. 142, no. 3, pp. 498-517, 2002.
18. C. Schuster and J. M. Framinan, "Approximate procedures for no-wait job shop scheduling," Oper. Res. Lett., vol. 31, pp. 308-18, 2003.
19. J. M. Framinan and C. Schuster, "An enhanced timetabling procedure for the no-wait job shop problem: A complete local search approach," Comput. Oper. Res., vol. 331, pp. 1200-13, 2006. (Pubitemid 41428286)
20. C. Schuster, "No-wait job shop scheduling: Tabu search and complexity of subproblems," Math. Methods Oper. Res., vol. 63, pp. 473-91, 2006. (Pubitemid 44075803)
21. C. Schuster, "No-wait job shop scheduling: Komplexität und local search," (in German) , University of Duisburg-Essen, Essen, Germany, 2003.
22. D. Ghosh and G. Sierksma, "Complete local search with memory," J. Heuristics, vol. 8, pp. 571-84, 2002. (Pubitemid 35338028)
23. F. Glover, "Tabu search-Part II," ORSA J. Comput., vol. 2, pp. 4-32, 1990.
24. D. Applegate and W. Cook, "A computational study of the job-shop problem," ORSA J. Comput., vol. 3, no. 2, pp. 149-56, 1991.
25. H. Fisher and G. L. Thompson, "Probabilistic learning combinations of local job-shop scheduling rules," in Industrial Scheduling. Englewood Cliffs, NJ: Prentice-Hall, 1963, pp. 225-51.
26. S. Lawrence, Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques. Technical Report Carnegie-Mellon University, Pittsburgh, 1984.
27. R. H. Storer, S. D. Wu, and R. Vaccari, "New search spaces for sequencing instances with application to job shop scheduling," Manage. Sci., vol. 38, pp. 1495-509, 1992. (Pubitemid 23633245)
28. J. Zhu, X. P. Li, and Q. Wang, "Complete local search with limited memory algorithm for no-wait job shops to minimize makespan," Eur. J. Oper. Res., vol. 198, no. 2, pp. 378-386, 2009.