Complete local search with limited memory algorithm for no-wait job shops to minimize makespan

In this paper, no-wait job shop problems with makespan minimization are considered. It is well known that these problems are strongly NP-hard. The problem is decomposed into the sequencing and the timetabling components. Shift timetabling is developed for the timetabling component. An effective method, CLLM (complete local search with limited memory), is presented by integrating with shift timetabling for the sequencing component. Experimental results show that CLLM outperforms all the existing effective algorithms for the considered problem with a little more computation time.

[1]  Jose M. Framiñan,et al.  An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach , 2006, Comput. Oper. Res..

[2]  C. V. Ramamoorthy,et al.  A Scheduling Problem , 1973 .

[3]  Han Hoogeveen,et al.  Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing , 2000, Eur. J. Oper. Res..

[4]  Jose M. Framiñan,et al.  Approximative procedures for no-wait job shop scheduling , 2003, Oper. Res. Lett..

[5]  J. K. Lenstra,et al.  Computational complexity of discrete optimization problems , 1977 .

[6]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[7]  Dario Pacciarelli,et al.  A Rollout Metaheuristic for Job Shop Scheduling Problems , 2004, Ann. Oper. Res..

[8]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[9]  Nikhil Bansal,et al.  Minimizing Makespan in No-Wait Job Shops , 2005, Math. Oper. Res..

[10]  Christoph J. Schuster.  No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems , 2006, Math. Methods Oper. Res..

[11]  Sartaj Sahni,et al.  Complexity of Scheduling Shops with No Wait in Process , 1979, Math. Oper. Res..

[12]  Andreas Klinkert,et al.  Surgical case scheduling as a generalized job shop scheduling problem , 2008, Eur. J. Oper. Res..

[13]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[14]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[15]  R. Macchiaroli,et al.  Modelling and optimization of industrial manufacturing processes subject to no-wait constraints , 1999 .

[16]  D. A. Wismer,et al.  Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..

[17]  Chelliah Sriskandarajah,et al.  Some no-wait shops scheduling problems: Complexity aspect , 1986 .

[18]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[19]  Gerard Sierksma,et al.  Complete Local Search with Memory , 2002, J. Heuristics.

[20]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[21]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

[22]  Józef Grabowski,et al.  Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..

[23]  Dario Pacciarelli,et al.  Job-shop scheduling with blocking and no-wait constraints , 2002, Eur. J. Oper. Res..