The strategies and parameters of tabu search for job-shop scheduling

This paper presents a tabu search approach for the job-shop scheduling problem. Although the problem is NP-hard, satisfactory solutions have been obtained recently by tabu search. However, tabu search has a problem-specific and parametric structure. Therefore, in the paper, we focussed on the tabu search strategies and parameters such as initial solution, neighborhood structure, tabu list, aspiration criterion, elite solutions list, intensification, diversification and the number of iteration. In order to compare some neighborhood strategies and tabu list length methods, a computational study is done on the benchmark problems.

[1]  J. Barnes,et al.  Solving the job shop scheduling problem with tabu search , 1995 .

[2]  Erwin Pesch,et al.  Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..

[3]  J. Wesley Barnes,et al.  A tabu search experience in production scheduling , 1993, Ann. Oper. Res..

[4]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

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

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

[7]  Adil Baykasoğlu,et al.  A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates , 1998 .

[8]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[9]  Stephen F. Smith,et al.  ISIS—a knowledge‐based system for factory scheduling , 1984 .

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

[11]  Yoshiyasu Takefuji,et al.  Stochastic neural networks for solving job-shop scheduling. II. architecture and simulations , 1988, IEEE 1988 International Conference on Neural Networks.

[12]  Adil Baykasoglu,et al.  A new integrated system for loading and scheduling in cellular manufacturing , 2002, Int. J. Comput. Integr. Manuf..

[13]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

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

[15]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[16]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[17]  Adil Baykasoğlu,et al.  Linguistic-based meta-heuristic optimization model for flexible job shop scheduling , 2002 .

[18]  Sheik Meeran,et al.  New and “Stronger” Job-Shop Neighbourhoods: A Focus on the Method of Nowicki and Smutnicki (1996) , 2000, J. Heuristics.

[19]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

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

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

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

[23]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[24]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[25]  Stéphane Dauzère-Pérès,et al.  A modified shifting bottleneck procedure for job-shop scheduling , 1993 .

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

[27]  Stephen F. Smith,et al.  Reactive Scheduling Systems , 1995 .

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

[29]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[30]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

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