Solving flexible job shop scheduling using an effective memetic algorithm

This paper proposes an effective Memetic Algorithm MA for the Flexible Job Shop Scheduling Problem FJSP with the objective of minimising the makespan. The proposed MA is a combination of TABU Search TS and Genetic Algorithm GA. This hybridisation presents an effective way of performing both exploration and exploitation by incorporating the local search abilities of TS with the global reaching capabilities of GA. The approach provides an effective encoding method, genetic operators and neighbourhood structure in order to effectively solve the FJSP. To evaluate the performance of the proposed MA, several benchmark instances of FJSP have been used. The experimental results show that the proposed MA is a very effective method for solving FJSP.

[1]  Pierre Borne,et al.  Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

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

[3]  M. Saravanan,et al.  Evaluation of meta-heuristic approaches for scheduling optimisation of flexible manufacturing systems , 2011, Int. J. Comput. Appl. Technol..

[4]  Kay Chen Tan,et al.  A Multiobjective Memetic Algorithm Based on Particle Swarm Optimization , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[5]  Camino R. Vela,et al.  Scheduling with Memetic Algorithms over the Spaces of Semi-active and Active Schedules , 2006, ICAISC.

[6]  Khaled Ghédira,et al.  New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach , 2008, Autonomous Agents and Multi-Agent Systems.

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

[8]  Lale Özbakır,et al.  Mathematical models for job-shop scheduling problems with routing and process plan flexibility , 2010 .

[9]  Peigen Li,et al.  An effective hybrid genetic algorithm for the job shop scheduling problem , 2008 .

[10]  F. Pezzella,et al.  A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..

[11]  Ehl Emile Aarts,et al.  A computational study of constraint satisfaction for multiple capacitated job shop scheduling , 1996 .

[12]  Liang Gao,et al.  An effective genetic algorithm for the flexible job-shop scheduling problem , 2011, Expert Syst. Appl..

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

[14]  Liang Gao,et al.  An effective multi-swarm collaborative evolutionary algorithm for flexible job shop scheduling problem , 2011, Proceedings of the 2011 15th International Conference on Computer Supported Cooperative Work in Design (CSCWD).

[15]  Ruhul A. Sarker,et al.  Memetic algorithms for solving job-shop scheduling problems , 2009, Memetic Comput..

[16]  James Smith,et al.  A tutorial for competent memetic algorithms: model, taxonomy, and design issues , 2005, IEEE Transactions on Evolutionary Computation.

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

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

[19]  Haoxun Chen,et al.  A genetic algorithm for flexible job-shop scheduling , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[20]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[21]  Ivan Tanev,et al.  Hybrid evolutionary algorithm-based real-world flexible job shop scheduling problem: application service provider approach , 2004, Appl. Soft Comput..

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

[23]  Ying Zhang,et al.  An improved multi-objective genetic algorithm for fuzzy flexible job-shop scheduling problem , 2013, Int. J. Comput. Appl. Technol..

[24]  Stéphane Dauzère-Pérès,et al.  Modelling and solving a practical flexible job-shop scheduling problem with blocking constraints , 2011 .

[25]  Haibo Hu,et al.  An Effective Hybrid Genetic Algorithm for Job Shop Scheduling Problem , 2011 .

[26]  Manuel Laguna,et al.  Tabu Search , 1997 .

[27]  Liang Gao,et al.  A multi-objective genetic algorithm for fuzzy flexible job-shop scheduling problem , 2012, Int. J. Comput. Appl. Technol..