Solving the flow shop problem by parallel programming

The matter of using scheduling algorithms in parallel computing environments is discussed in this paper. There are proposed methods of parallelizing the criterion function calculations for a single solution and a group of concentrated solutions (local neighborhood) dedicated to being used in metaheuristic approaches. Also a parallel scatter-search metaheuristic is proposed as a multiple-thread approach. Computational experiments are done for the flow shop, the classic NP-hard problem of the combinatorial optimization. © 2009 Elsevier Inc. All rights reserved.

[1]  C. Reeves,et al.  Genetic Algorithms, Path Relinking, the Flowshop Sequencing Problem and , 1998 .

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

[3]  Enrique Alba,et al.  Heterogeneous Computing and Parallel Genetic Algorithms , 2002, J. Parallel Distributed Comput..

[4]  Wojciech Bozejko,et al.  Parallel Genetic Algorithm for Minimizing Total Weighted Completion Time , 2004, ICAISC.

[5]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

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

[7]  C.K. Wong,et al.  Fast parallel heuristics for the job shop scheduling problem , 2002, Comput. Oper. Res..

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

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

[10]  Teodor Gabriel Crainic,et al.  Parallel Strategies for Meta-Heuristics , 2003, Handbook of Metaheuristics.

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

[12]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

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

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

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