A decomposition based multiobjective genetic algorithm with adaptive multipopulation strategy for flowshop scheduling problem

Abstract Recently, the solution algorithm for multiobjective scheduling problems has gained more and more concerns from the community of operational research since many real-world scheduling problems usually involve multiple objectives. In this paper, a new evolutionary multiobjective optimization (EMO) algorithm, which is termed as decomposition based multiobjective genetic algorithm with adaptive multipopulation strategy (DMOGA-AMP), is proposed to addressmultiobjective permutation flowshop scheduling problems (PFSPs). In the proposed DMOGA-AMP algorithm, a subproblem decomposition scheme is employed to decompose a multiobjective PFSP into a number of scalar optimization subproblems and then introduce the decomposed subproblems into the running course of algorithm in an adaptive fashion, while a subpopulation construction method is employed to construct multiple subpopulations adaptively to optimize their corresponding subproblems in parallel. In addition, several special strategies on genetic operations, i.e., selection, crossover, mutation and elitism, are also designed to improve the performance of DMOGA-AMP for the investigated problem. Based on a set of test instances of multiobjective PFSP, experiments are carried out to investigate the performance of DMOGA-AMP in comparison with several state-of-the-art EMO algorithms. The experimental results show the better performance of the proposed DMOGA-AMP algorithm in multiobjective flowshop scheduling.

[1]  C. Lee,et al.  A two-machine flowshop scheduling heuristic with bicriteria objective , 1998 .

[2]  Pei-Chann Chang,et al.  The development of a sub-population genetic algorithm II (SPGA II) for multi-objective combinatorial problems , 2009, Appl. Soft Comput..

[3]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[4]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[5]  Qingfu Zhang,et al.  Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II , 2009, IEEE Transactions on Evolutionary Computation.

[6]  Chandrasekharan Rajendran,et al.  Scheduling in flowshop and cellular manufacturing systems with multiple objectives— a genetic algorithmic approach , 1996 .

[7]  Jose M. Framiñan,et al.  Production , Manufacturing and Logistics Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation , 2002 .

[8]  Eckart Zitzler,et al.  Handling Uncertainty in Indicator-Based Multiobjective Optimization , 2006 .

[9]  B. Lin,et al.  Bicriteria scheduling in a two-machine permutation flowshop , 2006 .

[10]  Sunderesh S. Heragu,et al.  A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem , 1996, Ann. Oper. Res..

[11]  Kalyanmoy Deb,et al.  Reference point based multi-objective optimization using evolutionary algorithms , 2006, GECCO.

[12]  Shih-Wei Lin,et al.  Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm , 2013, Comput. Oper. Res..

[13]  W. Yeh.  An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem , 2001 .

[14]  Clarisse Dhaenens,et al.  An exact parallel method for a bi-objective permutation flowshop problem , 2007, Eur. J. Oper. Res..

[15]  Qingfu Zhang,et al.  MOEA/D for flowshop scheduling problems , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[16]  Ali Allahverdi,et al.  The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime , 2003, Eur. J. Oper. Res..

[17]  Mostafa Zandieh,et al.  An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times , 2011, J. Intell. Manuf..

[18]  Qingfu Zhang,et al.  Multiobjective evolutionary algorithms: A survey of the state of the art , 2011, Swarm Evol. Comput..

[19]  Lily Rachmawati,et al.  Multiobjective Evolutionary Algorithm With Controllable Focus on the Knees of the Pareto Front , 2009, IEEE Transactions on Evolutionary Computation.

[20]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[21]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[22]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization , 1999 .

[23]  Paolo Gaiardelli,et al.  Hybrid genetic algorithmsfor a multiple-objective scheduling problem , 1998, J. Intell. Manuf..

[24]  Ling Wang,et al.  A hybrid differential evolution method for permutation flow-shop scheduling , 2008 .

[25]  Vinícius Amaral Armentano,et al.  Genetic local search for multi-objective flowshop scheduling problems , 2005, Eur. J. Oper. Res..

[26]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[27]  F. Jolai,et al.  A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem , 2014, The International Journal of Advanced Manufacturing Technology.

[28]  John W. Fowler,et al.  A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines , 2003, Comput. Oper. Res..

[29]  Sunderesh S. Heragu,et al.  A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem , 1995 .

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

[31]  C. Rajendran,et al.  A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs , 2006 .

[32]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[33]  Ali Allahverdi,et al.  A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness , 2004, Comput. Oper. Res..

[34]  S. Ponnambalam,et al.  A TSP-GA multi-objective algorithm for flow-shop scheduling , 2004 .

[35]  Pei-Chann Chang,et al.  Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems , 2007, Expert Syst. Appl..