A divide and conquer-based greedy search for two-machine no-wait job shop problems with makespan minimisation

International Journal of Production Research

Volumn 50, Issue 10, 2012, Pages 2692-2704

  Zhu, Jie ^a,b   Li, Xiaoping ^a,b,c   Shen, Weiming ^c  

^a SOUTHEAST UNIVERSITY   (China)

^b Ministry of Education   (China)

^c NATIONAL RESEARCH COUNCIL CANADA   (Canada)

Author keywords

Job shop; No wait; Scheduling; Two machine

Indexed keywords

EID: 85003223626     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2011.582185     Document Type: Article

References (29)

1. Amir, M., et al., 2010. A variable neighbourhood search algorithm for the flexible job-shop scheduling problem. International Journal of Production Research, 48 (19), 5671-5689.
2. Bansal, N., Mahdian, M., and Sviridenko, M., 2005. Minimising makespan in no-wait job shops. Mathematics of Operations Research, 30 (4), 817-831.
3. Blazewicz, J., Domschke, W., and Pesch, E., 1996. The job-shop-scheduling-problem: conventional and new solution techniques. European Journal of Operational Research, 93, 1-33.
4. Dinh-Nguyen, P. and Andreas, K., 2008. Surgical case scheduling as a generalised job shop scheduling problem. European Journal of Operational Research, 185, 1011-1025.
5. Framinan, J.M. and Schuster, C., 2006. An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach. Computers & Operations Research, 331, 1200-1213.
6. Gilmore, P.C. and Gomory, R.E., 1964. Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Operations Research, 12, 655-679.
7. Grabowski, J. and Pempera, J., 2000. Sequencing of jobs in some production system. European Journal of Operational Research, 125, 535-550.
8. Graham, R.L., et al., 1979. Optimisation and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287-326.
9. Hall, N.G. and Sriskandarajah, C., 1996. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44, 510-525.
10. Jackson, J.R., 1956. An extension of Johnson’s results on job lot scheduling. Naval Research Logistics Quarterly, 3, 201-203.
11. Jain, A. and Meeran, S., 1990. Deterministic job-shop-scheduling: past, present and future. European Journal of Operational Research, 113 (2), 390-434.
12. Lenstra, J.K. and Rinnooy Kan, A.H.G., 1979. Computational complexity of discrete optimisation problems. Annals of Discrete Mathematics, 4, 121-140.
13. Liaw, C.F., 2008. An efficient simple metaheuristic for minimising the makespan in two-machine no-wait job shops. Computers & Operations Research, 35, 3276-3283.
14. Macchiaroli, R., Mole, S., and Riemma, S., 1999. Modelling and optimisation of industrial manufacturing processes subject to no-wait constraints. International Journal of Production Research, 37 (11), 2585-2607.
15. Mascis, A. and Pacciarelli, D., 2002. Job shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, 142 (3), 498-517.
16. Meloni, C., Pacciarelli, D., and Pranzo, M., 2004. A rollout metaheuristic for job shop scheduling problems. Annals of Operations Research, 131, 215-235.
17. Ovacik, I. and Uzsoy, R., 1997. Decomposition method for complex factory scheduling problems. Dordrecht: Kluwer Academic Publishing.
18. Raaymakers, W. and Hoogeveen, J., 2000. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research, 126, 131-151.
19. Rajendran, C., 1994. A no-wait flowshop scheduling heuristic to minimise makespan. Journal of the Operational Research Society, 45 (4), 472-478.
20. Rajkumar, M., Asokan, P., and Vamsikrishna, V., 2010. A GRASP algorithm for flexible job-shop scheduling with maintenance constraints. International Journal of Production Research, 48 (22), 6821-6836.
21. Reddi, S. and Ramamoorthy, C., 1973. A scheduling-problem. Operational Research Quarterly, 24, 441-446.
22. Sahni, S. and Cho, Y., 1979. Complexity of scheduling shops with no-wait in process. Mathematics of Operations Research, 4, 448-457.
23. Schuster, C. and Framinan, J.M., 2003. Approximate procedures for no-wait job shop scheduling. Operations Research Letters, 31, 308-318.
24. Schuster, C., 2006. No-wait job shop scheduling: Tabu search and complexity of subproblems. Mathematical Methods of Operations Research, 63, 473-491.
25. Tapan, P.B., Jatinder, N.D.G., and Chelliah, S., 2006. A review of TSP based approaches for flowshop scheduling. European Journal of Operational Research, 169, 816-854.
26. Wismer, D.A., 1972. Solution of the flowshop scheduling-problem with no intermediate queues. Operations Research, 20, 689-697.
27. Woeginger, G.J., 2004. Inapproximability results for no-wait job shop scheduling. Operations Research Letters, 32, 320-325.
28. Zandieh, M. and Adibi, M.A., 2010. Dynamic job shop scheduling using variable neighbourhood search. International Journal of Production Research, 48 (8), 2449-2458.
29. Zhu, J., Li, X.P., and Wang, Q., 2009. Complete local search with limited memory algorithm for no-wait job shops to minimise makespan. European Journal of Operational Research, 198 (2), 378-386.