Abstract
In this paper, the strongly NP-hard no-wait job shop problem with makespan minimization is considered. By alternatively adopting the “as early as possible” strategy or the “as late as possible” rule, an alternative delay timetabling method is constructed. The sequencing and timetabling subproblems are optimized simultaneously by calculating timetables using the proposed alternative method according to a given binary string. By integrating variable neighborhood structures, a new local search method, complete local search with memory and variable neighborhood structure (CLMMV), is presented for the considered problem. CLMMV is compared with the existing best method complete local search with limited memory (CLLM) for the considered problem on both small- and large-size benchmark instances. Experimental results show that CLMMV is similar to CLLM on effectiveness and CLMMV is much more efficient than CLLM.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blazewicz J, Domschke W, Pesch E (1996) The job shop scheduling problem: conventional and new solution techniques. Eur J Oper Res 93:1–33
Bożejko W, Makuchowski M (2009) A fast hybrid tabu search algorithm for the no-wait job shop problem. Comput Ind Eng 56(4):1502–1509
Bożejko W, Makuchowski M (2011) Solving the no-wait job-shop problem by using genetic algorithm with automatic adjustment. Int J Adv Manuf Technol 57(5):735–752
Framinan JM, Schuster C (2006) An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach. Comput Oper Res 33(5):1200–1213
Ghosh D, Sierksma G (2002) Complete local search with memory. J Heuristics 8(6):571–584
Grabowski J, Pempera J (2000) Sequencing of jobs in some production system. Eur J Oper Res 125(3):535–550
Jain AS, Meeran S (1999) Deterministic job-shop scheduling: past, present and future. Eur J Oper Res 113(2):390–434
Lenstra JK, Rinnooy Kan AHG (1979) Computational complexity of discrete optimization problems. Ann Discret Math 4:121–140
Ovacik I, Uzsoy R (1997) Decomposition method for complex factory scheduling problems. Kluwer, Boston
Pham DN, Klinkert A (2008) Surgical case scheduling as a generalized job shop scheduling problem. Eur J Oper Res 185(3):1011–1025
Raaymakers WHM, Hoogeveen JA (2000) Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. Eur J Oper Res 126(1):131–151
Rajendran C (1994) A no-wait flowshop scheduling heuristic to minimize makespan. J Oper Res Soc 45(2):472–478
Reddi SS, Ramamoorthy CV (1973) A scheduling problem. Oper Res Q 24(3):441–446
Schuster CJ (2006) No-wait job shop scheduling: tabu search and complexity of subproblems. Math Methods Oper Res 63(3):473–491
Schuster CJ, Framinan JM (2003) Approximative procedures for no-wait job shop scheduling. Oper Res Lett 31(4):308–318
Wismer DA (1972) Solution of the flowshop-scheduling problem with no intermediate queues. Oper Res 20(3):689–697
Zhu J, Li X, Wang Q (2009) Complete local search with limited memory algorithm for no-wait job shops to minimize makespan. Eur J Oper Res 198(2):378–386
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, X., Xu, H. & Li, M. A memory-based complete local search method with variable neighborhood structures for no-wait job shops. Int J Adv Manuf Technol 87, 1401–1408 (2016). https://doi.org/10.1007/s00170-013-4866-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-013-4866-4