An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops

This paper examines the problem of scheduling two-machine no-wait job shops to minimize makespan. The problem is known to be strongly NP-hard. A two-phase heuristic is developed to solve the problem. Phase 1 of the heuristic transforms the problem into a no-wait flow shop problem and solves it using the well known Gilmore and Gomory algorithm. Phase 2 of the heuristic improves the solution obtained in phase 1 using a simple tabu search algorithm. Computational results show that the proposed heuristic performs extremely well in terms of both solution quality and computation time. It finds an optimal solution to about 90% of the problem instances and the average deviation from the lower bond for the other problem instances is infinitesimal.

[1]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[2]  J. Piehler,et al.  Ein Beitrag zum Reihenfolgeproblem , 1960, Unternehmensforschung.

[3]  Gerhard J. Woeginger.  Inapproximability results for no-wait job shop scheduling , 2004, Oper. Res. Lett..

[4]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[5]  S. Shyu,et al.  Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..

[6]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[7]  C. Rajendran,et al.  Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .

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

[9]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

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

[11]  C. V. Ramamoorthy,et al.  On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .

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

[13]  Reha Uzsoy,et al.  Review of Decomposition Methods for Factory Scheduling Problems , 1997 .

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

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

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

[17]  Victor J. Rayward-Smith,et al.  Modern Heuristic Search Methods , 1996 .

[18]  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..

[19]  Józef Grabowski,et al.  Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..

[20]  James R. Jackson,et al.  An extension of Johnson's results on job IDT scheduling , 1956 .

[21]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[22]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

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

[24]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

[25]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[26]  Hans Röck,et al.  The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.

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