An Improved Nondominated Sorting Genetic Algorithm-II for Multi-objective Flexible Job-shop Scheduling Problem

This study focuses on the multi-objective flexible job-shop scheduling problem (MOFJSP) considering three objectives, namely maximal completion time, total workload of machines and maximal machine workload. An improved nondominated sorting genetic algorithm-II (INSGA-II) is developed to solve the MOFJSP. Specifically, a probability-based uniform crossover operator called “PEPPX” is designed to reach a tradeoff between exploration and exploitation. A novel”pruning-regenerating” mechanism (PRM), which can remove the redundant solutions in an elitist population and generate a new population via variable neighborhood search (VNS), is proposed to maintain the population diversity. Three objective-oriented local search operators for the VNS are elaborately designed based on critical path. Furthermore, a left-shift decoding method is applied to attain active schedules. Numerical experiments including two case studies confirm the effectiveness of the proposed INSGA-II.

[1]  Ling Wang,et al.  A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem , 2013 .

[2]  Deming Lei,et al.  Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling , 2012, Appl. Soft Comput..

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

[4]  Wei Liu,et al.  A memetic algorithm for multi-objective flexible job-shop problem with worker flexibility , 2018, Int. J. Prod. Res..

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

[6]  Shengyao Wang,et al.  An effective artificial bee colony algorithm for the flexible job-shop scheduling problem , 2012 .

[7]  Kun Chen,et al.  Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines , 2015, Journal of Intelligent Manufacturing.

[8]  Ch. Ratnam,et al.  An effective hybrid multi objective evolutionary algorithm for solving real time event in flexible job shop scheduling problem , 2018 .

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

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

[11]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

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

[13]  Quan-Ke Pan,et al.  An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems , 2012, Appl. Math. Comput..

[14]  Fernanda M. P. Raupp,et al.  A Newton-based heuristic algorithm for multi-objective flexible job-shop scheduling problem , 2016, J. Intell. Manuf..

[15]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

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

[17]  Pierre Hansen,et al.  Variable neighborhood search , 1997, Eur. J. Oper. Res..

[18]  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..

[19]  Qingfu Zhang,et al.  Multiobjective optimization Test Instances for the CEC 2009 Special Session and Competition , 2009 .

[20]  Abid Ali Khan,et al.  A research survey: review of flexible job shop scheduling techniques , 2016, Int. Trans. Oper. Res..

[21]  Kuan Yew Wong,et al.  Minimizing total carbon footprint and total late work criterion in flexible job shop scheduling by using an improved multi-objective genetic algorithm , 2018 .

[22]  Quan-Ke Pan,et al.  An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems , 2010, Comput. Ind. Eng..

[23]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[24]  Zhi-Hua Hu,et al.  Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem , 2014, Comput. Oper. Res..

[25]  Yongming Han,et al.  Review: Multi-objective optimization methods and application in energy saving , 2017 .

[26]  Jing Zhang,et al.  A hybrid particle swarm optimisation for multi-objective flexible job-shop scheduling problem with dual-resources constrained , 2017, Int. J. Comput. Sci. Math..

[27]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..