Hybrid tabu search for re-entrant permutation flow-shop scheduling problem

A re-entrant flow-shop (RFS) refers to situations in which every job must be processed on machines in the order, M"1,M"2,...,M"m, M"1,M"2,...,M"m,..., and M"1,M"2,...,M"m. Every job can be decomposed into several layers each of which starts on M"1 and finishes on M"m. In the RFS case, if the job ordering is the same on any machine at each layer, then no passing is said to be allowed, since no job is allowed to pass any former job. The RFS scheduling problem in which no passing is allowed, is called a re-entrant permutation flow-shop (RPFS) problem. This study considers RPFS scheduling, and applies hybrid tabu search (HTS) to minimize the makespan of jobs. The hybridization method is used to improve pure tabu search (TS) performance. The HTS is compared to the optimal solutions generated using the integer programming technique, and to the near optimal solutions generated by pure TS and heuristic NEH. The experimental results show that HTS has better performance than the others tested.

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

[2]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[3]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[4]  Wieslaw Kubiak,et al.  Mean Flow Time Minimization in Reentrant Job Shops with a Hub , 1996, Oper. Res..

[5]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[6]  J.-S. Chen,et al.  Minimizing makespan in re-entrant permutation flow-shops , 2003, J. Oper. Res. Soc..

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

[8]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[9]  V. A. Strusevich,et al.  A heuristic algorithm for two‐machine re‐entrant shop scheduling , 1999, Ann. Oper. Res..

[10]  H. Choi,et al.  A HYBRID OF TABU SEARCH AND INTEGER PROGRAMMING FOR SUBWAY CREW PARING OPTIMIZATION , 2002 .

[11]  J. U. Sun,et al.  PRODUCTION SEQUENCING PROBLEM WITH RE-ENTRANT WORK FLOWS AND SEQUENCE DEPENDENT SETUP TIMES , 1998 .

[12]  Daniel E. Rivera,et al.  A model predictive control approach for real-time optimization of reentrant manufacturing lines , 2001, Comput. Ind..

[13]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[14]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[15]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[16]  Eugeniusz Nowicki,et al.  The flow shop with parallel machines: A tabu search approach , 1998, Eur. J. Oper. Res..

[17]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[18]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[19]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[20]  Reha Uzsoy,et al.  Decomposition methods for reentrant flow shops with sequence‐dependent setup times , 2000 .

[21]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[22]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[23]  Stephen C. Graves,et al.  Scheduling of re-entrant flow shops , 1983 .

[24]  M. Y. Wang,et al.  Minimizing Makespan in a Class of Reentrant Shops , 1997, Oper. Res..

[25]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[26]  Carlos F. Bispo,et al.  Managing Simple re-entrant Flow Lines: Theoretical Foundation and Experimental Results , 2001 .

[27]  E. H. Bowman.  THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .

[28]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[29]  M. D. Wilkinson,et al.  Management science , 1989, British Dental Journal.

[30]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[31]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .