Parallel Simulated Annealing Algorithm for Cyclic Flexible Job Shop Scheduling Problem

This paper deals with scheduling of tasks in cyclic flexible job shop scheduling problem (CFJSSP). We have proposed a new method of computing cyclic time for CFJSSP. This method is based on the known properties of the job shop problem as well as new properties of cyclic scheduling. We have developed two versions of proposed method: sequential and parallel. The parallel version is dedicated to the computing devices supporting vector processing. Finally, we have developed double paralyzed simulated annealing algorithms: fine grained - vector processing, multiple walk - multi core processing. Computation results, provided on market multicore processors, are presented for a set of benchmark instances from the literature.

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

[2]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[3]  Wojciech Boejko.  On single-walk parallelization of the job shop problem solving algorithms , 2012 .

[4]  Dominik Zelazny,et al.  Optimizing Bicriteria Flow Shop Scheduling Problem By Simulated Annealing Algorithm , 2013, ICCS.

[5]  Wojciech Bozejko,et al.  Parallel tabu search algorithm for the hybrid flow shop problem , 2013, Comput. Ind. Eng..

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

[7]  Wojciech Bozejko,et al.  Parallel hybrid metaheuristics for the flexible job shop problem , 2010, Comput. Ind. Eng..

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

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

[10]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[11]  Thomas Kampmeyer,et al.  Cyclic Scheduling Problems , 2006 .

[12]  Andrew Y. C. Nee,et al.  A modified genetic algorithm for distributed scheduling problems , 2003, J. Intell. Manuf..

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

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

[15]  Pempera Jarosław,et al.  Optimizing Bicriteria Flow Shop Scheduling Problem by Simulated Annealing Algorithm , 2013, ICCS 2013.

[16]  Peter Brucker,et al.  Cyclic job shop scheduling problems with blocking , 2008, Ann. Oper. Res..