Solving the flow shop problem by parallel tabu search

We present a parallel tabu search algorithm for the permutation flow shop sequencing problem with the objective of minimizing the flowtime. We propose a neighbourhood using so-called blocks of jobs on a critical path and a backtrace jump method. By computer simulations it is shown that the performance of the proposed algorithm is comparable with the random heuristic technique discussed in literature. Another interesting property is the fact that the speedup of parallel implementation is equal or even greater than p, where p is the number of processors.

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

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

[3]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

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

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

[6]  Wojciech Bozejko,et al.  Solving the Flow Shop Problem by Parallel Simulated Annealing , 2001, PPAM.

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

[8]  Colin R. Reeves,et al.  Improving the Efficiency of Tabu Search for Machine Sequencing Problems , 1993 .

[9]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

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

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

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

[13]  J. Grabowski,et al.  New block properties for the permutation flow shop problem with application in tabu search , 2001, J. Oper. Res. Soc..

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

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

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

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

[18]  Emile H. L. Aarts,et al.  Sequential and parallel local search algorithms for job shop scheduling , 1997 .

[19]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

[20]  El-Ghazali Talbi,et al.  Parallel Tabu Search for Large Optimization Problems , 1999 .