An effective hybrid algorithm for multi-objective flexible job-shop scheduling problem

Genetic algorithm is one of primary algorithms extensively used to address the multi-objective flexible job-shop scheduling problem. However, genetic algorithm converges at a relatively slow speed. By hybridizing genetic algorithm with particle swarm optimization, this article proposes a teaching-and-learning-based hybrid genetic-particle swarm optimization algorithm to address multi-objective flexible job-shop scheduling problem. The proposed algorithm comprises three modules: genetic algorithm, bi-memory learning, and particle swarm optimization. A learning mechanism is incorporated into genetic algorithm, and therefore, during the process of evolution, the offspring in genetic algorithm can learn the characteristics of elite chromosomes from the bi-memory learning. For solving multi-objective flexible job-shop scheduling problem, this study proposes a discrete particle swarm optimization algorithm. The population is partitioned into two subpopulations for genetic algorithm module and particle swarm optimization module. These two algorithms simultaneously search for solutions in their own subpopulations and exchange the information between these two subpopulations, such that both algorithms can complement each other with advantages. The proposed algorithm is evaluated on some instances, and experimental results demonstrate that the proposed algorithm is an effective method for multi-objective flexible job-shop scheduling problem.

[1]  Nhu Binh Ho,et al.  Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems , 2008, Comput. Ind. Eng..

[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]  Mitsuo Gen,et al.  A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems , 2007, Comput. Ind. Eng..

[4]  Lars Mönch,et al.  Heuristic approaches for scheduling jobs in large-scale flexible job shops , 2016, Comput. Oper. Res..

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

[6]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

[7]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[8]  Ahmed El Hilali Alaoui,et al.  The "Dual-Ants Colony": A novel hybrid approach for the flexible job shop scheduling problem with preventive maintenance , 2017, Comput. Ind. Eng..

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

[10]  Amin Jamili,et al.  Robust job shop scheduling problem: Mathematical models, exact and heuristic algorithms , 2016, Expert Syst. Appl..

[11]  Liang Gao,et al.  An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times , 2017, Comput. Ind. Eng..

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

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

[14]  Nhu Binh Solving Multiple-Objective Flexible Job Shop Problems by Evolution and Local Search , 2008 .

[15]  Liang Xu Genetic algorithm controlled by two thresholds for Job Shop scheduling problem , 2007 .

[16]  Li-Ning Xing,et al.  An efficient search method for multi-objective flexible job shop scheduling problems , 2009, J. Intell. Manuf..

[17]  X. Shao,et al.  A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem , 2010 .

[18]  Xinyu Li,et al.  An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem , 2016 .

[19]  Arit Thammano,et al.  Modified Genetic Algorithm for Flexible Job-Shop Scheduling Problems , 2012, Complex Adaptive Systems.

[20]  Hua Xu,et al.  Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms , 2015, IEEE Transactions on Automation Science and Engineering.

[21]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[22]  Nasser Shahsavari-Pour,et al.  A novel hybrid meta-heuristic algorithm for solving multi objective flexible job shop scheduling , 2013 .

[23]  Osman Kulak,et al.  Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem , 2016, Comput. Ind. Eng..

[24]  Joc Cing Tay,et al.  An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules , 2004, GECCO.

[25]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

[26]  Ryosuke Kubota,et al.  Effective hierarchical optimization by a hierarchical multi-space competitive genetic algorithm for the flexible job-shop scheduling problem , 2015, Expert Syst. Appl..

[27]  Min Liu,et al.  An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling , 2012 .

[28]  Quan-Ke Pan,et al.  Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems , 2011 .