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.
Similar content being viewed by others
References
Allahverdi A (2003) The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime. Eur J Oper Res 147(2):373–396
Allahverdi A (2004) A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. Comput Oper Res 31(2):157–180
Arroyo JEC, Armentano VA (2005) Genetic local search for multi-objective flowshop scheduling problems. Eur J Oper Res 167(3):717–738
Asefi H, Jolai F, Rabiee M, Araghi MT (2014) A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem. Int J Adv Manuf Technol 75(5–8):1017–1033
Basseur M, Zitzler E (2006) Handling uncertainty in indicator-based on multiobjective optimization. Int J Comput Intell Res 2(3):255–272
Cavalieri S, Gaiardelli P (1998) Hybrid genetic algorithms for a multiple-objective scheduling problem. J Intell Manuf 9:361–367
Chakravarthy K, Rajendran C (1999) A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization. Prod Plan Control 10:707–714
Chang PC, Chen SH (2009) The development of a sub-population genetic algorithm II (SPGA II) for multi-objective combinatorial problems. Appl Soft Comput 9:173–181
Chang PC, Chen SH, Liu CH (2007) Sub-population genetic algorithm with mining gene structures for multiobjective flow shop scheduling problem. Expert Syst Appl 33:762–771
Chang PC, Chen SH, Zhang Q, Liu JL (2008) MOEA/D for flow shop scheduling problems. In: Proceedings of 2008 IEEE world congress on computational intelligence, pp 1433–1438
Cochran JK, Horng SM, Fowler JW (2003) A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Comput Oper Res 30(7):1087–1102
Deb K, Pratap A, Agarwal S (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197
Deb K, Sundar J, Rao N, Chaudhuri S (2006) Reference point based multiobjective optimization using evolutionary algorithms. Int J Comput Intell Res 2(3):273–286
Framinan JM, Leisten R, Ruiz-Usano R (2002) Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation. Eur J Oper Res 141(3):559–569
Graham RL, Lawler EL, Lenstra JK, Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287–326
Ishibuchi H, Murata T (1998) A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Syst Man Cybern Part C Appl Rev 28(3):392–403
Ishibuchi H, Yoshida T, Murata T (2003) Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans Evol Comput 7(2):204–223
Lee CE, Chou FD (1998) A two-machine flowshop scheduling heuristic with bicriteria objective. Int J Ind Eng 5(2):128–139
Lemesre J, Dhaenens C, Talbi EG (2007) An exact parallel method for a biobjective permutation flowshop problem. Eur J Oper Res 177(3):1641–1655
Li H, Zhang Q (2009) Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II. IEEE Trans Evol Comput 13(2):284–302
Lin BMT, Wu JM (2006) Bicriteria scheduling in a two-machine permutation flowshop. Int J Prod Res 44(12):2299–2312
Lin SW, Ying KC (2013) Minimizing makespan and total flow time in permutation flow shops by a bi-objective multi-start simulated-annealing algorithm. Comput Oper Res 40(6):1625–1647
Murata T, Ishibuchi H, Tanaka H (1996) Multi-objective genetic algorithm and its applications to flowshop scheduling. Comput Ind Eng 30(4):957–968
Nagar A, Heragu SS, Haddock J (1995) A branch-and-bound approach for a two-machine flowshop scheduling problem. J Oper Res 46(6):721–734
Nagar A, Heragu SS, Haddock J (1996) A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem. Ann Oper Res 63:397–414
Pasupathy T, Rajendran C, Suresh RK (2006) A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs. Int J Adv Manuf Technol 27(7–8):804–815
Ponnambalam SG, Jagannathan H, Kataria M, Gadicherla A (2004) A TSP-GA multiobjective algorithm for flow-shop scheduling. Int J Adv Manuf Technol 23(11–12):909–915
Qian B, Wang L, Hu R, Wang WL, Huang DX, Wang X (2008) A hybrid differential evolution method for permutation flow-shop scheduling. Int J Adv Manuf Technol 38(7–8):757–777
Rachmawati L, Srinivasan D (2009) Multiobjective evolutionary algorithm with controllable focus on the knees of the Pareto front. IEEE Trans Evol Comput 13(4):810–824
Sridhar J, Rajendran C (1996) Scheduling in flowshop and cellular manufacturing systems with multiple objectives: a genetic algorithmic approach. Prod Plann Control 7(4):374–382
Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221–248
Yeh W-C (2001) An efficient branch-and-bound algorithm for the two-machine bicriteriaflowshop scheduling problem. J Manuf Syst 20(2):113–123
Zandieh M, Karimi N (2011) An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times. J Intell Manuf 22(6):979–989
Zhang Q, Li H (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731
Zhou A, Qu B, Li H, Zhao S, Suganthan P (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol Comput 1:32–49
Acknowledgements
This work was supported by the National Science Foundation for Distinguished Young Scholars of China (Grant Numbers 71325002, 61225012); the National Nature Science Foundation of China (Grant Numbers 71001018, 71071028, 71671032, 71571156); Fundamental Research Funds for the Central Universities (Grant Numbers N110204005, N130404017, N160402002); and Fundamental Research Funds for State Key Laboratory of Synthetical Automation for Process Industries (Grant Numbers 2013ZCX11, PAL-N201505), Shandong Provincial Natural Science Foundation of China (Grant Number ZR2016FP02), Qingdao Postdoctoral Research Project (Grant Number 2016027).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fu, Y., Wang, H., Huang, M. et al. A decomposition based multiobjective genetic algorithm with adaptive multipopulation strategy for flowshop scheduling problem. Nat Comput 18, 757–768 (2019). https://doi.org/10.1007/s11047-016-9602-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-016-9602-1