A tabu search approach for the flow shop scheduling problem

In this paper, we propose a tabu search approach for solving the permutation flow shop scheduling problem. The proposed implementation of the tabu search approach suggests simple techniques for generating neighborhoods of a given sequence and a combined scheme for intensification and diversification that has not been considered before. These new features result in an implementation that improves upon previous tabu search implementations that use mechanisms of comparable simplicity. Also, better results were obtained than those produced by a simulated annealing algorithm from the literature.

[1]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

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

[3]  Jatinder N. D. Gupta,et al.  A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .

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

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

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

[7]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[8]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

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

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

[11]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[12]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

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

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

[15]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[16]  Yih-Long Chang,et al.  A new heuristic for the n-job, M-machine flow-shop problem , 1991 .

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

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

[19]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[20]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[21]  Jayant Rajgopal,et al.  An extension of Palmer's heuristic for the flow shop scheduling problem , 1988 .