An effective multi-swarm collaborative evolutionary algorithm for flexible job shop scheduling problem

Flexible job shop scheduling problem (FJSP) is a very important problem in the modern manufacturing system. It is an extension of the classical job shop scheduling problem. It allows an operation to be processed by any machine from a given set. It is also a NP-hard problem. This paper proposes a multi-swarm collaborative evolutionary algorithm (MSCEA) to solve FJSP. Experimental studies have been used to test the approach, and the comparisons have been made between this approach and some previous approaches to indicate the adaptability and superiority of the proposed approach. The experimental results show that the proposed approach is a promising and very effective method on the research of FJSP.

[1]  Fariborz Jolai,et al.  Mathematical modeling and heuristic approaches to flexible job shop scheduling problems , 2007, J. Intell. Manuf..

[2]  Nhu Binh Ho,et al.  An effective architecture for learning and evolving flexible job-shop schedules , 2007, Eur. J. Oper. Res..

[3]  P. Suganthan,et al.  A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem , 2011 .

[4]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

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

[6]  Mohammad Saidi-Mehrabad,et al.  Flexible job shop scheduling with tabu search algorithms , 2007 .

[7]  Mostafa Zandieh,et al.  Flexible job-shop scheduling with parallel variable neighborhood search algorithm , 2010, Expert Syst. Appl..

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

[9]  Mostafa Zandieh,et al.  A variable neighbourhood search algorithm for the flexible job-shop scheduling problem , 2010 .

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

[11]  Imed Kacem,et al.  Genetic algorithm for the flexible job-shop scheduling problem , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

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

[13]  Abid Ali Khan,et al.  A Genetic Algorithm for Flexible Job Shop Scheduling , 2013 .