Parallel estimation of the cost function for the flexible scheduling problem

The aim of this paper is to show how to determine the neighborhood of the complex discrete optimization problem and how to search it in the parallel environment, this being illustrated by an example of the hybrid scheduling, more precisely a flexible job shop problem. We present a parallel single-walk approach in this respect. A theoretical analysis based on PRAM model of parallel computing has been made. We propose a cost-optimal method of neighborhood generation parallelization.

[1]  Wojciech Bozejko,et al.  Parallel Meta2heuristics for the Flexible Job Shop Problem , 2010, ICAISC.

[2]  Wojciech Bozejko,et al.  The new golf neighborhood for the exible job shop problem , 2010, ICCS.

[3]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[4]  Nhu Binh Ho,et al.  GENACE: an efficient cultural algorithm for solving the flexible job-shop problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[5]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

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

[7]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[8]  Jan Paulli,et al.  A hierarchical approach for the FMS scheduling problem , 1995 .

[9]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

[10]  Michael Pinedo.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[11]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[12]  Wojciech Boa,et al.  The new golf neighborhood for the flexible job shop problem , 2010 .

[13]  Wojciech Bożejko,et al.  A New Class of Parallel Scheduling Algorithms , 2010 .