Parallel Path-Relinking Method for the Flow Shop Scheduling Problem

The matter of using scheduling algorithms in parallel computing environments is discussed in the paper. A parallel path-relinking approach based on scatter search metaheuristics is proposed for the flow shop problem with C max and C sum criteria. Obtained results are very promising: the superlinear speedup is observed for some versions of the parallel algorithm.

[1]  Czeslaw Smutnicki,et al.  Some results of the worst-case analysis for flow shop scheduling , 1998, Eur. J. Oper. Res..

[2]  Griffin Caprio,et al.  Parallel Metaheuristics , 2008, IEEE Distributed Systems Online.

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

[4]  Wojciech Bozejko,et al.  Solving the flow shop problem by parallel tabu search , 2002, Proceedings. International Conference on Parallel Computing in Electrical Engineering.

[5]  Wojciech Bozejko,et al.  Parallel Genetic Algorithm for the Flow Shop Scheduling Problem , 2003, PPAM.

[6]  F. Glover,et al.  Sequential and parallel path-relinking algorithms for the quadratic assignment problem , 2005, IEEE Intelligent Systems.

[7]  Enrique Alba,et al.  Parallel Metaheuristics: A New Class of Algorithms , 2005 .

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

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

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

[11]  T. Crainic,et al.  Parallel Meta-Heuristics , 2010 .

[12]  Eugeniusz Nowicki,et al.  Some aspects of scatter search in the flow-shop problem , 2006, Eur. J. Oper. Res..

[13]  Jean-Marie Proth,et al.  Heuristic approaches for n/m/F/ ∑Ci scheduling problems , 1997 .

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

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

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