An improved shifting bottleneck procedure for the job shop scheduling problem

Abstract In this paper, the job shop scheduling problem with the objective to minimize the makespan is discussed. A theorem on the shifting bottleneck procedure (SB) for solving this problem is proven, which guarantees an application of the procedure slightly modified from SB to obtain feasible solution of the problem. Based on this theorem, an improved shifting bottleneck procedure (ISB) for the job shop scheduling problem has been proposed. Besides ISB is implemented straightly, a refined version that combines ISB with the strategy of back tracking is presented. These two procedures have been tested on many benchmarks with various sizes and hardness levels. The computational experiment shows that ISB is more efficient and effective than SB. Also, some encouraging results about the refined version are obtained.

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

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

[3]  Kevin Mahon,et al.  Deterministic and Stochastic Scheduling , 1983 .

[4]  J. Lenstra,et al.  Job-Shop Scheduling by Implicit Enumeration , 1977 .

[5]  Emanuela Merelli,et al.  A tabu search method guided by shifting bottleneck for the job shop scheduling problem , 2000, Eur. J. Oper. Res..

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

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

[8]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

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

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

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

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

[13]  Jan Karel Lenstra,et al.  Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .

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

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

[16]  A. S. Spachis,et al.  Job-shop scheduling heuristics with local neighbourhood search , 1979 .

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

[18]  J. Carlier.  The one-machine sequencing problem , 1982 .

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