New block properties for the permutation flow shop problem with application in tabu search

This paper deals with the classic flow-shop scheduling problem with the make-span criterion. Some new properties of the problem associated with the so-called blocks have been presented and discussed. The properties allow us to skip some non-perspective solutions during the search of the solution space. Applied to local search algorithms, they result in a significant reduction of neighbourhood size and quickly direct the search trajectory to promising regions of the solution space. The implementation of the proposed properties in a tabu search algorithm is also presented. Computational experiments (up to 500 jobs and 20 machines) are given and compared with the results yielded by the best known algorithms.

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

[2]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[3]  Eugeniusz Nowicki,et al.  New Results in the Worst-Case Analysis for Flow-Shop Scheduling , 1993, Discret. Appl. Math..

[4]  Stanislaw Zdrzalka,et al.  An algorithm for single machine sequencing with release dates to minimize maximum cost , 1989, Discret. Appl. Math..

[5]  Czesław Smutnicki,et al.  A two-machine permutation flow shop scheduling problem with buffers , 1998 .

[6]  J. Grabowski.  A New Algorithm of Solving the Flow — Shop Problem , 1982 .

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

[8]  E. Nowicki,et al.  A block approach for single-machine scheduling with release dates and due dates , 1986 .

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

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

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

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

[13]  J. Grabowski,et al.  On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness , 1983 .

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

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

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

[17]  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..

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