{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T20:54:22Z","timestamp":1775940862657,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T00:00:00Z","timestamp":1485993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s11047-016-9602-1","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T07:36:42Z","timestamp":1486021002000},"page":"757-768","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A decomposition based multiobjective genetic algorithm with adaptive multipopulation strategy for flowshop scheduling problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Yaping","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongfeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junwei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,2]]},"reference":[{"issue":"2","key":"9602_CR1","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/S0377-2217(02)00253-9","volume":"147","author":"A Allahverdi","year":"2003","unstructured":"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\u2013396","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9602_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0305-0548(02)00143-0","volume":"31","author":"A Allahverdi","year":"2004","unstructured":"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\u2013180","journal-title":"Comput Oper Res"},{"issue":"3","key":"9602_CR3","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/j.ejor.2004.07.017","volume":"167","author":"JEC Arroyo","year":"2005","unstructured":"Arroyo JEC, Armentano VA (2005) Genetic local search for multi-objective flowshop scheduling problems. Eur J Oper Res 167(3):717\u2013738","journal-title":"Eur J Oper Res"},{"issue":"5\u20138","key":"9602_CR4","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s00170-014-6177-9","volume":"75","author":"H Asefi","year":"2014","unstructured":"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\u20138):1017\u20131033","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"9602_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.5019\/j.ijcir.2006.66","volume":"2","author":"M Basseur","year":"2006","unstructured":"Basseur M, Zitzler E (2006) Handling uncertainty in indicator-based on multiobjective optimization. Int J Comput Intell Res 2(3):255\u2013272","journal-title":"Int J Comput Intell Res"},{"key":"9602_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1023\/A:1008935027685","volume":"9","author":"S Cavalieri","year":"1998","unstructured":"Cavalieri S, Gaiardelli P (1998) Hybrid genetic algorithms for a multiple-objective scheduling problem. J Intell Manuf 9:361\u2013367","journal-title":"J Intell Manuf"},{"key":"9602_CR7","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1080\/095372899232777","volume":"10","author":"K Chakravarthy","year":"1999","unstructured":"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\u2013714","journal-title":"Prod Plan Control"},{"key":"9602_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.asoc.2008.04.002","volume":"9","author":"PC Chang","year":"2009","unstructured":"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\u2013181","journal-title":"Appl Soft Comput"},{"key":"9602_CR9","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1016\/j.eswa.2006.06.019","volume":"33","author":"PC Chang","year":"2007","unstructured":"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\u2013771","journal-title":"Expert Syst Appl"},{"key":"9602_CR10","doi-asserted-by":"crossref","unstructured":"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\u20131438","DOI":"10.1109\/CEC.2008.4630982"},{"issue":"7","key":"9602_CR11","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1016\/S0305-0548(02)00059-X","volume":"30","author":"JK Cochran","year":"2003","unstructured":"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\u20131102","journal-title":"Comput Oper Res"},{"issue":"2","key":"9602_CR12","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"9602_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.5019\/j.ijcir.2006.67","volume":"2","author":"K Deb","year":"2006","unstructured":"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\u2013286","journal-title":"Int J Comput Intell Res"},{"issue":"3","key":"9602_CR14","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0377-2217(01)00278-8","volume":"141","author":"JM Framinan","year":"2002","unstructured":"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\u2013569","journal-title":"Eur J Oper Res"},{"key":"9602_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287\u2013326","journal-title":"Ann Discret Math"},{"issue":"3","key":"9602_CR16","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H Ishibuchi","year":"1998","unstructured":"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\u2013403","journal-title":"IEEE Trans Syst Man Cybern Part C Appl Rev"},{"issue":"2","key":"9602_CR17","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/TEVC.2003.810752","volume":"7","author":"H Ishibuchi","year":"2003","unstructured":"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\u2013223","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9602_CR18","first-page":"128","volume":"5","author":"CE Lee","year":"1998","unstructured":"Lee CE, Chou FD (1998) A two-machine flowshop scheduling heuristic with bicriteria objective. Int J Ind Eng 5(2):128\u2013139","journal-title":"Int J Ind Eng"},{"issue":"3","key":"9602_CR19","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1016\/j.ejor.2005.10.011","volume":"177","author":"J Lemesre","year":"2007","unstructured":"Lemesre J, Dhaenens C, Talbi EG (2007) An exact parallel method for a biobjective permutation flowshop problem. Eur J Oper Res 177(3):1641\u20131655","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9602_CR20","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"H Li","year":"2009","unstructured":"Li H, Zhang Q (2009) Multiobjective optimization problems with complicated Pareto sets, MOEA\/D and NSGA-II. IEEE Trans Evol Comput 13(2):284\u2013302","journal-title":"IEEE Trans Evol Comput"},{"issue":"12","key":"9602_CR21","doi-asserted-by":"publisher","first-page":"2299","DOI":"10.1080\/00207540500446394","volume":"44","author":"BMT Lin","year":"2006","unstructured":"Lin BMT, Wu JM (2006) Bicriteria scheduling in a two-machine permutation flowshop. Int J Prod Res 44(12):2299\u20132312","journal-title":"Int J Prod Res"},{"issue":"6","key":"9602_CR22","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.1016\/j.cor.2011.08.009","volume":"40","author":"SW Lin","year":"2013","unstructured":"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\u20131647","journal-title":"Comput Oper Res"},{"issue":"4","key":"9602_CR23","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1016\/0360-8352(96)00045-9","volume":"30","author":"T Murata","year":"1996","unstructured":"Murata T, Ishibuchi H, Tanaka H (1996) Multi-objective genetic algorithm and its applications to flowshop scheduling. Comput Ind Eng 30(4):957\u2013968","journal-title":"Comput Ind Eng"},{"issue":"6","key":"9602_CR24","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1057\/jors.1995.102","volume":"46","author":"A Nagar","year":"1995","unstructured":"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\u2013734","journal-title":"J Oper Res"},{"key":"9602_CR25","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF02125405","volume":"63","author":"A Nagar","year":"1996","unstructured":"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\u2013414","journal-title":"Ann Oper Res"},{"issue":"7\u20138","key":"9602_CR26","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1007\/s00170-004-2249-6","volume":"27","author":"T Pasupathy","year":"2006","unstructured":"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\u20138):804\u2013815","journal-title":"Int J Adv Manuf Technol"},{"issue":"11\u201312","key":"9602_CR27","first-page":"909","volume":"23","author":"SG Ponnambalam","year":"2004","unstructured":"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\u201312):909\u2013915","journal-title":"Int J Adv Manuf Technol"},{"issue":"7\u20138","key":"9602_CR28","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s00170-007-1115-8","volume":"38","author":"B Qian","year":"2008","unstructured":"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\u20138):757\u2013777","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"9602_CR29","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1109\/TEVC.2009.2017515","volume":"13","author":"L Rachmawati","year":"2009","unstructured":"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\u2013824","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"9602_CR30","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1080\/09537289608930365","volume":"7","author":"J Sridhar","year":"1996","unstructured":"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\u2013382","journal-title":"Prod Plann Control"},{"issue":"3","key":"9602_CR31","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221\u2013248","journal-title":"Evol Comput"},{"issue":"2","key":"9602_CR32","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0278-6125(01)80034-0","volume":"20","author":"W-C Yeh","year":"2001","unstructured":"Yeh W-C (2001) An efficient branch-and-bound algorithm for the two-machine bicriteriaflowshop scheduling problem. J Manuf Syst 20(2):113\u2013123","journal-title":"J Manuf Syst"},{"issue":"6","key":"9602_CR33","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/s10845-009-0374-7","volume":"22","author":"M Zandieh","year":"2011","unstructured":"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\u2013989","journal-title":"J Intell Manuf"},{"issue":"6","key":"9602_CR34","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"9602_CR35","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"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\u201349","journal-title":"Swarm Evol Comput"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-016-9602-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-016-9602-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-016-9602-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,9]],"date-time":"2019-11-09T05:17:14Z","timestamp":1573276634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-016-9602-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,2]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["9602"],"URL":"https:\/\/doi.org\/10.1007\/s11047-016-9602-1","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,2]]},"assertion":[{"value":"2 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}