Minimizing makespan in reentrant flow-shops using hybrid tabu search

This study considers the problem of reentrant flow-shop (RFS) scheduling, and applies hybrid tabu search (HTS) to minimize the makespan of jobs. The hybridization method is used to enhance the performance of pure tabu search. The HTS is compared to the optimal solutions generated by the integer programming technique, and to the near optimal solutions generated by pure tabu search and the non-delay schedule generation procedure. Computational experiments are performed to illustrate the effectiveness and efficiency of the proposed HTS algorithm.

[1]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

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

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

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

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

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

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

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

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

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

[11]  Thomas A. Feo,et al.  A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties , 1996, Comput. Oper. Res..

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

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

[14]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[15]  Reha Uzsoy,et al.  A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNING , 1992 .

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

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

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

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

[20]  Lars Mönch,et al.  A distributed shifting bottleneck heuristic for complex job shops , 2005, Comput. Ind. Eng..

[21]  Jonathan F. Bard,et al.  Heuristics for the flow line problem with setup costs , 1998, Eur. J. Oper. Res..

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

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

[24]  Shu-Hsing Chung,et al.  A case study on the multistage IC final testing scheduling problem with reentry , 2004 .

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

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

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

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