{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:34:05Z","timestamp":1759847645663},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"8-9","license":[{"start":{"date-parts":[[2008,8,9]],"date-time":"2008-08-09T00:00:00Z","timestamp":1218240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s00500-008-0350-8","type":"journal-article","created":{"date-parts":[[2008,8,8]],"date-time":"2008-08-08T08:14:30Z","timestamp":1218183270000},"page":"847-869","source":"Crossref","is-referenced-by-count":20,"title":["Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution"],"prefix":"10.1007","volume":"13","author":[{"given":"Bin","family":"Qian","sequence":"first","affiliation":[]},{"given":"Ling","family":"Wang","sequence":"additional","affiliation":[]},{"given":"De-Xian","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Xiong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,8,9]]},"reference":[{"key":"350_CR1","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1016\/S0305-0548(02)00068-0","volume":"30","author":"T Aldowaisan","year":"2003","unstructured":"Aldowaisan T, Allahverdi A (2003) New heuristics for no-wait flowshops to minimize makespan. Comput Oper Res 30: 1219\u20131231","journal-title":"Comput Oper Res"},{"key":"350_CR2","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/S0377-2217(02)00646-X","volume":"152","author":"A Allahverdi","year":"2004","unstructured":"Allahverdi A, Aldowaisan T (2004) No-wait flowshops with bicriteria of makespan and maximum lateness. Eur J Oper Res 152: 132\u2013147","journal-title":"Eur J Oper Res"},{"key":"350_CR3","doi-asserted-by":"crossref","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: 717\u2013738","journal-title":"Eur J Oper Res"},{"key":"350_CR4","volume-title":"Introduction to sequencing and scheduling","author":"KR Baker","year":"1974","unstructured":"Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York"},{"issue":"2","key":"350_CR5","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetic algorithm and random keys for sequencing and optimization. ORSA J Comput 6(2): 154\u2013160","journal-title":"ORSA J Comput"},{"key":"350_CR6","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1057\/jors.1976.176","volume":"24","author":"MC Bonney","year":"1976","unstructured":"Bonney MC, Gundry SW (1976) Solutions to the constrained flowshop sequencing problem. Oper Res Quart 24: 869\u2013883","journal-title":"Oper Res Quart"},{"issue":"1","key":"350_CR7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/TSMCB.2006.883271","volume":"37","author":"A Caponio","year":"2007","unstructured":"Caponio A, Cascella GL, Neri F, Salvatore N, Sumner M (2007) A fast adaptive memetic algorithm for online and offline control design of PMSM drives. IEEE T Syst Man Cybern B 37(1): 28\u201341","journal-title":"IEEE T Syst Man Cybern B"},{"key":"350_CR8","first-page":"333","volume":"12","author":"J Carlier","year":"1978","unstructured":"Carlier J (1978) Ordonnancements a contraintes disjonctives. R.A.I.R.O. Recherche operationelle\/Oper Res 12: 333\u2013351","journal-title":"R.A.I.R.O. Recherche operationelle\/Oper Res"},{"issue":"1","key":"350_CR9","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/TPWRD.2004.835033","volume":"20","author":"YP Chang","year":"2005","unstructured":"Chang YP, Wu CJ (2005) Optimal multiobjective planning of large-scale passive harmonic filters using hybrid differential evolution method considering parameter and loading uncertainty. IEEE T Power Deliver 20(1): 408\u2013416","journal-title":"IEEE T Power Deliver"},{"key":"350_CR10","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/0360-8352(96)00042-3","volume":"30","author":"CL Chen","year":"1996","unstructured":"Chen CL, Neppalli RV, Aljaber N (1996) Genetic algorithms applied to the continuous flow-shop problem. Comput Ind Eng 30: 919\u2013929","journal-title":"Comput Ind Eng"},{"issue":"1","key":"350_CR11","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6","volume":"7","author":"P Czyzak","year":"1998","unstructured":"Czyzak P, Jaszkiewicz A (1998) Pareto-simulated annealing\u2014a metaheuristic technique for multi-objective combinatorial optimization. J Multi-Crit Decis Anal 7(1): 34\u201347","journal-title":"J Multi-Crit Decis Anal"},{"issue":"2","key":"350_CR12","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE T Evol Comput 6(2): 182\u2013197","journal-title":"IEEE T Evol Comput"},{"key":"350_CR13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/4235.850651","volume":"4","author":"C Dimopoulos","year":"2000","unstructured":"Dimopoulos C, Zalzala AMS (2000) Recent development in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons. IEEE T Evolut Comput 4: 93\u2013113","journal-title":"IEEE T Evolut Comput"},{"key":"350_CR14","volume-title":"Differential evolution: in search of solutions","author":"V Feoktistov","year":"2006","unstructured":"Feoktistov V (2006) Differential evolution: in search of solutions. Springer, Heidelberg"},{"issue":"(3","key":"350_CR15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0925-5273(93)90042-J","volume":"32","author":"R Gangadharan","year":"1993","unstructured":"Gangadharan R, Rajendran C (1993) Heuristic algorithms for scheduling in the no-wait flowshop. Int J Prod Econ 32((3): 285\u2013290","journal-title":"Int J Prod Econ"},{"key":"350_CR16","volume-title":"Computers and intractability: a guide to the theory of np-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of np-completeness. Freeman, San Francisco"},{"issue":"1","key":"350_CR17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.ejor.2006.06.010","volume":"181","author":"MJ Geiger","year":"2007","unstructured":"Geiger MJ (2007) On operators and search space topology in multi-objective flow-shop scheduling. Eur J Oper Res 181(1): 195\u2013206","journal-title":"Eur J Oper Res"},{"key":"350_CR18","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1016\/j.cor.2004.02.009","volume":"32","author":"J Grabowski","year":"2005","unstructured":"Grabowski J, Pempera J (2005) Some local search algorithms for no-wait flow-shop problem with makespan criterion. Comput Oper Res 32: 2197\u20132212","journal-title":"Comput Oper Res"},{"key":"350_CR19","volume-title":"Recent advances in memetic algorithms","author":"WE Hart","year":"2004","unstructured":"Hart WE, Krasnogor N, Smith JE (2004) Recent advances in memetic algorithms. Springer, Heidelberg"},{"key":"350_CR20","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"NG Hall","year":"1996","unstructured":"Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44: 510\u2013525","journal-title":"Oper Res"},{"key":"350_CR21","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1287\/opre.8.2.178","volume":"8","author":"J Heller","year":"1960","unstructured":"Heller J (1960) Some numerical experiments for an M\u00a0\u00d7\u00a0J flow-shop and its decision-theoretical aspects. Oper Res 8: 178\u2013184","journal-title":"Oper Res"},{"issue":"1","key":"350_CR22","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1023\/A:1022995128597","volume":"17","author":"J Ilonen","year":"2003","unstructured":"Ilonen J, Kamarainen JK, Lampinen J (2003) Differential evolution training algorithm for feed-forward neural networks. Neural Process Lett 17(1): 93\u2013105","journal-title":"Neural Process Lett"},{"issue":"3","key":"350_CR23","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H Ishibuchi","year":"1998","unstructured":"Ishibuchi H, Murata T (1998) A multiobjective genetic local search algorithm and its application to flowshop scheduling. IEEE T Syst Man Cybern C 28(3): 392\u2013403","journal-title":"IEEE T Syst Man Cybern C"},{"key":"350_CR24","doi-asserted-by":"crossref","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 T Evol Comput 7: 204\u2013223","journal-title":"IEEE T Evol Comput"},{"issue":"1","key":"350_CR25","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/S0377-2217(01)00104-7","volume":"137","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz A (2002) Genetic local search for multi-objective combinatorial optimization. Eur J Oper Res 137(1): 50\u201371","journal-title":"Eur J Oper Res"},{"issue":"2","key":"350_CR26","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TEVC.2003.810759","volume":"7","author":"A Jaszkiewicz","year":"2003","unstructured":"Jaszkiewicz A (2003) Do multiple-objective metaheuristcs deliver on their promises? A computational experiment on the set-covering problem. IEEE T Evolut Comput 7(2): 133\u2013143","journal-title":"IEEE T Evolut Comput"},{"issue":"3","key":"350_CR27","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1109\/TEVC.2003.810733","volume":"7","author":"EF Jonathan","year":"2003","unstructured":"Jonathan EF, Richard ME, Sameer S (2003) Using unconstrained elite archives for multiobjective optimization. IEEE T Evolut Comput 7(3): 305\u2013323","journal-title":"IEEE T Evolut Comput"},{"key":"350_CR28","first-page":"343","volume":"18","author":"JR King","year":"1980","unstructured":"King JR, Spachis AS (1980) Heuristics for flowshop scheduling. Int J Prod Res 18: 343\u2013357","journal-title":"Int J Prod Res"},{"key":"350_CR29","doi-asserted-by":"crossref","unstructured":"Knowles JD, Corne DW (2002) On metrics for comparing nondominated sets. In: 2002 Congress on Evolutionary Computation, Honolulu, HI, USA, pp 711\u2013716","DOI":"10.1109\/CEC.2002.1007013"},{"key":"350_CR30","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0360-8352(00)00035-8","volume":"38","author":"S Kumar","year":"2000","unstructured":"Kumar S, Bagchi TP, Sriskandarajah C (2000) Lot streaming and scheduling heuristics for m-machine no-wait flowshops. Comput Ind Eng 38: 149\u2013172","journal-title":"Comput Ind Eng"},{"issue":"9\u201310","key":"350_CR31","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1007\/s00170-005-0277-5","volume":"31","author":"B Liu","year":"2007","unstructured":"Liu B, Wang L, Jin YH (2007) An effective hybrid particle swarm optimization for no-wait flow-shop scheduling. Int J Adv Manuf Tech 31(9\u201310): 1001\u20131011","journal-title":"Int J Adv Manuf Tech"},{"key":"350_CR32","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/0360-8352(96)00053-8","volume":"30","author":"T Murata","year":"1996","unstructured":"Murata T, Ishibuchi H, Tanaka H (1996) Genetic algorithms for flowshop scheduling problems. Comput Ind Eng 30: 1061\u20131071","journal-title":"Comput Ind Eng"},{"key":"350_CR33","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1016\/j.cor.2006.08.013","volume":"35","author":"AC Nearchou","year":"2008","unstructured":"Nearchou AC (2008) A differential evolution approach for the common due date early\/tardy job scheduling problem. Comput Oper Res 35: 1329\u20131343","journal-title":"Comput Oper Res"},{"key":"350_CR34","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24: 1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"6","key":"350_CR35","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/10732-006-3750-x","volume":"12","author":"AC Nearchou","year":"2006","unstructured":"Nearchou AC, Omirou SL (2006) Differential evolution for sequencing and scheduling optimization. J Heuristics 12(6): 395\u2013411","journal-title":"J Heuristics"},{"issue":"2","key":"350_CR36","first-page":"264","volume":"4","author":"F Neri","year":"2007","unstructured":"Neri F, Toivanen J, Cascella GL, Ong YS (2007) An adaptive multimeme algorithm for designing HIV multidrug therapies. IEEE ACM T Comput BI 4(2): 264\u2013278","journal-title":"IEEE ACM T Comput BI"},{"key":"350_CR37","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/j.ejor.2004.08.021","volume":"169","author":"E Nowicki","year":"2006","unstructured":"Nowicki E, Smutnicki C (2006) Some aspects of scatter search in the flow-shop problem. Eur J Oper Res 169: 654\u2013666","journal-title":"Eur J Oper Res"},{"key":"350_CR38","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","volume":"8","author":"YS Ong","year":"2004","unstructured":"Ong YS, Keane AJ (2004) Meta-Lamarckian learning in memetic algorithms. IEEE T Evol Comput 8: 99\u2013110","journal-title":"IEEE T Evol Comput"},{"issue":"1","key":"350_CR39","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","volume":"36","author":"YS Ong","year":"2006","unstructured":"Ong YS, Lim MH, Zhu N, Wong KW (2006) Classification of adaptive memetic algorithms: a comparative study. IEEE T Syst Man Cy B 36(1): 141\u2013152","journal-title":"IEEE T Syst Man Cy B"},{"issue":"2","key":"350_CR40","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.ejor.2004.08.043","volume":"171","author":"G Onwubolu","year":"2006","unstructured":"Onwubolu G, Davendra D (2006) Scheduling flow-shops using differential evolution algorithm. Eur J Oper Res 171(2): 674\u2013692","journal-title":"Eur J Oper Res"},{"key":"350_CR41","volume-title":"Scheduling: theory, algorithms and systems","author":"M Pinedo","year":"2002","unstructured":"Pinedo M (2002) Scheduling: theory, algorithms and systems, 2nd edn. Prentice-Hall, NJ","edition":"2"},{"key":"350_CR42","unstructured":"Price K, Storn R (2007) Differential evolution (DE) for continuous function optimization. http:\/\/www.icsi.berkeley.edu\/%7Estorn\/code.html . Accessed 13 July 2007"},{"key":"350_CR43","unstructured":"Price K, Storn R, Lampinen J (2005) Differential evolution: a practical approach to global optimization. Springer, Berlin, pp 227\u2013238"},{"key":"350_CR44","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1007\/s00170-006-0787-9","volume":"35","author":"B Qian","year":"2008","unstructured":"Qian B, Wang L, Huang DX, Wang X (2008) Scheduling multi-objective job shops using a memetic algorithm based on differential evolution. Int J Adv Manuf Technol 35: 1014\u20131027","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"350_CR45","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.cor.2007.08.007","volume":"36","author":"B Qian","year":"2009","unstructured":"Qian B, Wang L, Huang DX, Wang WL, Wang X (2009) An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Comput Oper Res 36(1): 209\u2013233","journal-title":"Comput Oper Res"},{"issue":"4","key":"350_CR46","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1057\/jors.1994.65","volume":"45","author":"C Rajendran","year":"1994","unstructured":"Rajendran C (1994) A no-wait flowshop scheduling heuristic to minimize makespan. J Oper Res Soc 45(4): 472\u2013478","journal-title":"J Oper Res Soc"},{"key":"350_CR47","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22: 5\u201313","journal-title":"Comput Oper Res"},{"key":"350_CR48","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1023\/A:1018983524911","volume":"86","author":"CR Reeves","year":"1999","unstructured":"Reeves CR (1999) Landscapes, operations and heuristic search. Ann Oper Res 86: 473\u2013490","journal-title":"Ann Oper Res"},{"key":"350_CR49","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1162\/evco.1998.6.1.45","volume":"6","author":"CR Reeves","year":"1998","unstructured":"Reeves CR, Yamada T (1998) Genetic algorithms, path relinking and the flowshop sequencing problem. Evol Comput 6: 45\u201360","journal-title":"Evol Comput"},{"issue":"10","key":"350_CR50","doi-asserted-by":"crossref","first-page":"3143","DOI":"10.1016\/j.cor.2005.11.022","volume":"34","author":"T Schiavinotto","year":"2007","unstructured":"Schiavinotto T, St\u00fctzle T (2007) A review of metrics on permutations for search landscape analysis. Comput Oper Res 34(10): 3143\u20133153","journal-title":"Comput Oper Res"},{"key":"350_CR51","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.ejor.2004.03.001","volume":"163","author":"H Stadtler","year":"2005","unstructured":"Stadtler H (2005) Supply chain management and advanced planning-basics, overview and challenges. Eur J Oper Res 163: 575\u2013588","journal-title":"Eur J Oper Res"},{"issue":"4","key":"350_CR52","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2013a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4): 341\u2013359","journal-title":"J Glob Optim"},{"key":"350_CR53","unstructured":"Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2004) Differential evolution algorithm for permutation flowshop sequencing problem with makespan criterion. In: Proceedings of 4th international symposium on intelligent manufacturing systems, Sakarya, Turkey, pp 442\u2013452"},{"issue":"9","key":"350_CR54","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1007\/s00500-006-0139-6","volume":"11","author":"J Tang","year":"2007","unstructured":"Tang J, Lim MH, Ong YS (2007) Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems. Soft Comput 11(9): 873\u2013888","journal-title":"Soft Comput"},{"key":"350_CR55","doi-asserted-by":"crossref","unstructured":"Tavakkoli-Moghaddam R, Rahimi-Vahed A, Hossein Mirzaei A (2007) A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighed mean completion time and weighted mean tardiness. Inf Sci. doi: 10.1016\/j.ins.2007.06.001","DOI":"10.1016\/j.ins.2007.06.001"},{"key":"350_CR56","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64: 278\u2013285","journal-title":"Eur J Oper Res"},{"key":"350_CR57","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1080\/05695557408974929","volume":"6","author":"JM Van Deman","year":"1974","unstructured":"Van Deman JM, Baker KR (1974) Minimizing mean flow time in the flowshop with no intermediate queues. AIIE Trans 6: 28\u201334","journal-title":"AIIE Trans"},{"key":"350_CR58","volume-title":"Shop scheduling with genetic algorithms","author":"L Wang","year":"2003","unstructured":"Wang L (2003) Shop scheduling with genetic algorithms. Tsinghua Univ. Press & Springer, Beijing"},{"key":"350_CR59","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE T Evol Comput 1: 67\u201382","journal-title":"IEEE T Evol Comput"},{"issue":"10","key":"350_CR60","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1007\/s00500-006-0145-8","volume":"11","author":"Z Zhou","year":"2007","unstructured":"Zhou Z, Ong YS, Lim MH, Lee BS (2007) Memetic algorithm using multi-surrogates for computationally expensive optimization problems. Soft Comput 11(10): 957\u2013971","journal-title":"Soft Comput"},{"issue":"1","key":"350_CR61","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/TSMCB.2006.883267","volume":"37","author":"Z Zhu","year":"2007","unstructured":"Zhu Z, Ong YS, Dash M (2007) Wrapper-filter feature selection algorithm using a memetic framework. IEEE T Syst Man Cybern B 37(1): 70\u201376","journal-title":"IEEE T Syst Man Cybern B"},{"issue":"4","key":"350_CR62","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE T Evolut Comput 3(4): 257\u2013271","journal-title":"IEEE T Evolut Comput"},{"issue":"2","key":"350_CR63","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: Empirical results. IEEE T Evol Comput 8(2): 173\u2013195","journal-title":"IEEE T Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0350-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-008-0350-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0350-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:39:55Z","timestamp":1559093995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-008-0350-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,9]]},"references-count":63,"journal-issue":{"issue":"8-9","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["350"],"URL":"https:\/\/doi.org\/10.1007\/s00500-008-0350-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,9]]}}}