{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:07:41Z","timestamp":1743102461431,"version":"3.40.3"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030729035"},{"type":"electronic","value":"9783030729042"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-72904-2_9","type":"book-chapter","created":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T11:03:03Z","timestamp":1616756583000},"page":"136-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Flowshop NEH-Based Heuristic Recommendation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5622-392X","authenticated-orcid":false,"given":"Lucas Marcondes","family":"Pavelski","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4372-5162","authenticated-orcid":false,"given":"Marie-\u00c9l\u00e9onore","family":"Kessaci","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2791-174X","authenticated-orcid":false,"given":"Myriam","family":"Delgado","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,27]]},"reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.ejor.2019.10.004","volume":"282","author":"P Alfaro-Fern\u00e1ndez","year":"2020","unstructured":"Alfaro-Fern\u00e1ndez, P., Ruiz, R., Pagnozzi, F., St\u00fctzle, T.: Automatic algorithm design for hybrid flowshop scheduling problems. Eur. J. Oper. Res. 282(3), 835\u2013845 (2020). https:\/\/doi.org\/10.1016\/j.ejor.2019.10.004","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1002\/9780470451793.app1","volume-title":"Principles of Sequencing and Scheduling","author":"KR Baker","year":"2009","unstructured":"Baker, K.R., Trietsch, D.: Appendix A: practical processing time distributions. Principles of Sequencing and Scheduling, pp. 445\u2013458. John Wiley & Sons Ltd., Hoboken (2009). https:\/\/doi.org\/10.1002\/9780470451793.app1"},{"key":"9_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/9780470451793","volume-title":"Principles of Sequencing and Scheduling","author":"KR Baker","year":"2009","unstructured":"Baker, K.R., Trietsch, D.: Principles of Sequencing and Scheduling. Wiley Publishing, New Jersey (2009)"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001). https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach. Learn."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-77449-7_6","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"A Brum","year":"2018","unstructured":"Brum, A., Ritt, M.: Automatic algorithm configuration for the permutation flow shop scheduling problem minimizing total completion time. In: Liefooghe, A., L\u00f3pez-Ib\u00e1\u00f1ez, M. (eds.) EvoCOP 2018. LNCS, vol. 10782, pp. 85\u2013100. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77449-7_6"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Brum, A., Ritt, M.: Automatic design of heuristics for minimizing the makespan in permutation flow shops. In: 2018 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138, July 2018. https:\/\/doi.org\/10.1109\/CEC.2018.8477787","DOI":"10.1109\/CEC.2018.8477787"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"105044","DOI":"10.1016\/j.cor.2020.105044","volume":"125","author":"F Burcin Ozsoydan","year":"2021","unstructured":"Burcin Ozsoydan, F., Sa\u011fir, M.: Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant. Comput. Oper. Res. 125, 105044 (2021). https:\/\/doi.org\/10.1016\/j.cor.2020.105044","journal-title":"Comput. Oper. Res."},{"key":"9_CR8","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-319-91086-4_14","volume-title":"Handbook of Metaheuristics","author":"EK Burke","year":"2019","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches: revisited. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 453\u2013477. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_14"},{"issue":"10","key":"9_CR9","doi-asserted-by":"publisher","first-page":"B630","DOI":"10.1287\/mnsc.16.10.B630","volume":"16","author":"HG Campbell","year":"1970","unstructured":"Campbell, H.G., Dudek, R.A., Smith, M.L.: A heuristic algorithm for the n job, m machine sequencing problem. Manage. Sci. 16(10), B630\u2013B637 (1970)","journal-title":"Manage. Sci."},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10732-010-9155-x","volume":"18","author":"J Czogalla","year":"2012","unstructured":"Czogalla, J., Fink, A.: Fitness landscape analysis for the no-wait flow-shop scheduling problem. J. Heuristics 18(1), 25\u201351 (2012). https:\/\/doi.org\/10.1007\/s10732-010-9155-x","journal-title":"J. Heuristics"},{"issue":"11","key":"9_CR11","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1287\/mnsc.23.11.1174","volume":"23","author":"DG Dannenbring","year":"1977","unstructured":"Dannenbring, D.G.: An evaluation of flow shop sequencing heuristics. Manage. Sci. 23(11), 1174\u20131182 (1977). https:\/\/doi.org\/10.1287\/mnsc.23.11.1174","journal-title":"Manage. Sci."},{"issue":"1","key":"9_CR12","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7(1), 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"issue":"12","key":"9_CR13","doi-asserted-by":"publisher","first-page":"3962","DOI":"10.1016\/j.cor.2007.05.005","volume":"35","author":"X Dong","year":"2008","unstructured":"Dong, X., Huang, H., Chen, P.: An improved NEH-based heuristic for the permutation flowshop problem. Comput. Oper. Res. 35(12), 3962\u20133968 (2008). https:\/\/doi.org\/10.1016\/j.cor.2007.05.005","journal-title":"Comput. Oper. Res."},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Dubois-Lacoste, J., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Automatic configuration of state-of-the-art multi-objective optimizers using the TP+PLS framework. In: Proceedings of the 13th annual conference on Genetic and evolutionary computation. GECCO 2011, pp. 2019\u20132026. Association for Computing Machinery, New York, NY, USA, July 2011. https:\/\/doi.org\/10.1145\/2001576.2001847","DOI":"10.1145\/2001576.2001847"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Emmons, H., Vairaktarakis, G.: Theoretical results, algorithms, and applications. In: Flow Shop Scheduling. International Series in Operations Research & Management Science, vol. 182, 11th edn. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-5152-5","DOI":"10.1007\/978-1-4614-5152-5"},{"issue":"7","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1016\/j.cor.2013.01.005","volume":"40","author":"M Fatih Tasgetiren","year":"2013","unstructured":"Fatih Tasgetiren, M., Pan, Q.K., Suganthan, P.N., Buyukdagli, O.: A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem. Comput. Oper. Res. 40(7), 1729\u20131743 (2013). https:\/\/doi.org\/10.1016\/j.cor.2013.01.005","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9_CR17","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10732-014-9275-9","volume":"22","author":"C Fawcett","year":"2016","unstructured":"Fawcett, C., Hoos, H.H.: Analysing differences between algorithm configurations through ablation. J. Heuristics 22(4), 431\u2013458 (2016). https:\/\/doi.org\/10.1007\/s10732-014-9275-9","journal-title":"J. Heuristics"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.cor.2013.12.012","volume":"45","author":"V Fernandez-Viagas","year":"2014","unstructured":"Fernandez-Viagas, V., Framinan, J.M.: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem. Comput. Oper. Res. 45, 60\u201367 (2014). https:\/\/doi.org\/10.1016\/j.cor.2013.12.012","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"9_CR19","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1057\/palgrave.jors.2601784","volume":"55","author":"JM Framinan","year":"2004","unstructured":"Framinan, J.M., Gupta, J.N.D., Leisten, R.: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J. Oper. Res. Soc. 55(12), 1243\u20131255 (2004). https:\/\/doi.org\/10.1057\/palgrave.jors.2601784","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1080\/00207540210161650","volume":"41","author":"JM Framinan","year":"2003","unstructured":"Framinan, J.M., Leisten, R., Rajendran, C.: Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. Int. J. Prod. Res. 41(1), 121\u2013148 (2003). https:\/\/doi.org\/10.1080\/00207540210161650","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Hernando, L., Daolio, F., Veerapen, N., Ochoa, G.: Local optima networks of the permutation flowshop scheduling problem: makespan vs. total flow time. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 1964\u20131971. IEEE, San Sebastian, Spain, June 2017. https:\/\/doi.org\/10.1109\/CEC.2017.7969541","DOI":"10.1109\/CEC.2017.7969541"},{"key":"9_CR23","volume-title":"Stochastic Local Search: Foundations and Applications","author":"HH Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Elsevier, San Francisco, USA (2004)"},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Res. Logistics Q. 1(1), 61\u201368 (1954). https:\/\/doi.org\/10.1002\/nav.3800010110","journal-title":"Naval Res. Logistics Q."},{"issue":"9","key":"9_CR25","doi-asserted-by":"publisher","first-page":"3001","DOI":"10.1016\/j.cor.2007.01.020","volume":"35","author":"PJ Kalczynski","year":"2008","unstructured":"Kalczynski, P.J., Kamburowski, J.: An improved NEH heuristic to minimize makespan in permutation flow shops. Comput. Oper. Res. 35(9), 3001\u20133008 (2008). https:\/\/doi.org\/10.1016\/j.cor.2007.01.020","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ejor.2008.08.021","volume":"198","author":"PJ Kalczynski","year":"2009","unstructured":"Kalczynski, P.J., Kamburowski, J.: An empirical analysis of the optimality rate of flow shop heuristics. Eur. J. Oper. Res. 198(1), 93\u2013101 (2009). https:\/\/doi.org\/10.1016\/j.ejor.2008.08.021","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9_CR27","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.omega.2005.03.003","volume":"35","author":"PJ Kalczynski","year":"2007","unstructured":"Kalczynski, P.J., Kamburowski, J.: On the NEH heuristic for minimizing the makespan in permutation flow shops. Omega 35(1), 53\u201360 (2007). https:\/\/doi.org\/10.1016\/j.omega.2005.03.003","journal-title":"Omega"},{"issue":"1","key":"9_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco\\_a_00242","volume":"27","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Hoos, H.H., Neumann, F., Trautmann, H.: Automated algorithm selection: survey and perspectives. Evol. Comput. 27(1), 3\u201345 (2019). https:\/\/doi.org\/10.1162\/evco_a_00242","journal-title":"Evol. Comput."},{"issue":"2","key":"9_CR29","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0377-2217(00)00137-5","volume":"132","author":"J Liu","year":"2001","unstructured":"Liu, J., Reeves, C.R.: Constructive and composite heuristic solutions to the P\/\/$$\\sum {C}_i$$ scheduling problem. Eur. J. Oper. Res. 132(2), 439\u2013452 (2001). https:\/\/doi.org\/10.1016\/S0377-2217(00)00137-5","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-25566-3_18","volume-title":"Learning and Intelligent Optimization","author":"M-E Marmion","year":"2011","unstructured":"Marmion, M.-E., Dhaenens, C., Jourdan, L., Liefooghe, A., Verel, S.: On the neutrality of flowshop scheduling fitness landscapes. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 238\u2013252. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_18"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-319-19084-6_14","volume-title":"Learning and Intelligent Optimization","author":"M-E Marmion","year":"2015","unstructured":"Marmion, M.-E., Regnier-Coudert, O.: Fitness landscape of the factoradic representation on the permutation flowshop scheduling problem. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 151\u2013164. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19084-6_14"},{"key":"9_CR32","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.cor.2014.05.020","volume":"51","author":"F Mascia","year":"2014","unstructured":"Mascia, F., L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., St\u00fctzle, T.: Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools. Comput. Oper. Res. 51, 190\u2013199 (2014). https:\/\/doi.org\/10.1016\/j.cor.2014.05.020","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"9_CR33","doi-asserted-by":"publisher","first-page":"1374","DOI":"10.1057\/palgrave.jors.2601466","volume":"53","author":"MS Nagano","year":"2002","unstructured":"Nagano, M.S., Moccellin, J.V.: A high quality solution constructive heuristic for flow shop sequencing. J. Oper. Res. Soc. 53(12), 1374\u20131379 (2002)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"9_CR34","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1080\/0305215X.2018.1444163","volume":"51","author":"MS Nagano","year":"2019","unstructured":"Nagano, M.S., Rossi, F.L., Martarelli, N.J.: High-performing heuristics to minimize flowtime in no-idle permutation flowshop. Eng. Optim. 51(2), 185\u2013198 (2019). https:\/\/doi.org\/10.1080\/0305215X.2018.1444163","journal-title":"Eng. Optim."},{"issue":"1","key":"9_CR35","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1), 91\u201395 (1983). https:\/\/doi.org\/10.1016\/0305-0483(83)90088-9","journal-title":"Omega"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-99259-4_20","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"G Ochoa","year":"2018","unstructured":"Ochoa, G., Herrmann, S.: Perturbation strength and the global structure of QAP fitness landscapes. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 245\u2013256. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99259-4_20"},{"issue":"1","key":"9_CR37","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1057\/jors.1965.8","volume":"16","author":"DS Palmer","year":"1965","unstructured":"Palmer, D.S.: Sequencing jobs through a multi-stage process in the minimum total time\u2013a quick method of obtaining a near optimum. J. Oper. Res. Soc. 16(1), 101\u2013107 (1965). https:\/\/doi.org\/10.1057\/jors.1965.8","journal-title":"J. Oper. Res. Soc."},{"issue":"7","key":"9_CR38","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1007\/s00170-007-1120-y","volume":"38","author":"QK Pan","year":"2008","unstructured":"Pan, Q.K., Wang, L., Zhao, B.H.: An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion. Int. J. Adv. Manuf. Technol. 38(7), 778\u2013786 (2008). https:\/\/doi.org\/10.1007\/s00170-007-1120-y","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"9_CR39","doi-asserted-by":"publisher","unstructured":"Pavelski, L.M., Delgado, M.R., Kessaci, M.\u00c9.: Meta-learning on flowshop using fitness landscape analysis. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO 2019, pp. 925\u2013933. ACM, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3321707.3321846","DOI":"10.1145\/3321707.3321846"},{"issue":"1","key":"9_CR40","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0925-5273(93)90024-F","volume":"29","author":"C Rajendran","year":"1993","unstructured":"Rajendran, C.: Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. Int. J. Prod. Econ. 29(1), 65\u201373 (1993). https:\/\/doi.org\/10.1016\/0925-5273(93)90024-F","journal-title":"Int. J. Prod. Econ."},{"key":"9_CR41","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1023\/A:1018983524911","volume":"86","author":"C Reeves","year":"1999","unstructured":"Reeves, C.: Landscapes, operators and heuristic search. Ann. Oper. Res. 86, 473\u2013490 (1999). https:\/\/doi.org\/10.1023\/A:1018983524911","journal-title":"Ann. Oper. Res."},{"issue":"12","key":"9_CR42","doi-asserted-by":"publisher","first-page":"2062","DOI":"10.1016\/j.cor.2010.02.006","volume":"37","author":"I Ribas","year":"2010","unstructured":"Ribas, I., Companys, R., Tort-Martorell, X.: Comparing three-step heuristics for the permutation flow shop problem. Comput. Oper. Res. 37(12), 2062\u20132070 (2010). https:\/\/doi.org\/10.1016\/j.cor.2010.02.006","journal-title":"Comput. Oper. Res."},{"key":"9_CR43","doi-asserted-by":"publisher","unstructured":"Rice, J.R.: The algorithm selection problem. In: Rubinoff, M., Yovits, M.C. (eds.) Advances in Computers, Advances in Computers, vol. 15, pp. 65\u2013118. Elsevier, Washington, DC, USA (1976). https:\/\/doi.org\/10.1016\/S0065-2458(08)60520-3, iSSN: 0065-2458","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"9_CR44","unstructured":"Rodriguez, J.A.V., Petrovic, S., Salhi, A.: A combined meta-heuristic with hyper-heuristic approach to the scheduling of the hybrid flow shop with sequence dependent setup times and uniform machines. In: Baptiste, P., Kendall, G., Munier-Kordon, A., Sourd, F. (eds.) In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), pp. 506\u2013513. Paris, France (2007), issue: 0"},{"issue":"2","key":"9_CR45","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R Ruiz","year":"2005","unstructured":"Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flowshop heuristics. Eur. J. Oper. Res. 165(2), 479\u2013494 (2005). https:\/\/doi.org\/10.1016\/j.ejor.2004.04.017","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"9_CR46","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1080\/00207548208947802","volume":"20","author":"JP Stinson","year":"1982","unstructured":"Stinson, J.P., Smith, A.W.: A heuristic pro\u01f5rammin\u01f5 procedure for sequencin\u01f5 the static flowshop. Int. J. Prod. Res. 20(6), 753\u2013764 (1982). https:\/\/doi.org\/10.1080\/00207548208947802","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"9_CR47","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"\u00c9 Taillard","year":"1990","unstructured":"Taillard, \u00c9.: Some efficient heuristic methods for the flow shop sequencing problem. Eur. J. Oper. Res. 47(1), 65\u201374 (1990). https:\/\/doi.org\/10.1016\/0377-2217(90)90090-X","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9_CR48","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"\u00c9 Taillard","year":"1993","unstructured":"Taillard, \u00c9.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993). https:\/\/doi.org\/10.1016\/0377-2217(93)90182-M","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9_CR49","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.ejor.2014.07.033","volume":"240","author":"E Vallada","year":"2015","unstructured":"Vallada, E., Ruiz, R., Framinan, J.M.: New hard benchmark for flowshop scheduling problems minimising makespan. Eur. J. Oper. Res. 240(3), 666\u2013677 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2014.07.033","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9_CR50","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1162\/106365600568095","volume":"8","author":"VK Vassilev","year":"2000","unstructured":"Vassilev, V.K., Fogarty, T.C., Miller, J.F.: Information characteristics and the structure of landscapes. Evol. Comput. 8(1), 31\u201360 (2000)","journal-title":"Evol. Comput."},{"key":"9_CR51","unstructured":"Watson, J.P., Barbulescu, L., Howe, A.E., Whitley, L.D.: Algorithm performance and problem structure for flow-shop scheduling. In: AAAI\/IAAI, pp. 688\u2013695. American Association for Artificial Intelligence, Menlo Park, CA, USA (1999)"},{"key":"9_CR52","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1016\/j.procs.2015.08.199","volume":"60","author":"H Yahyaoui","year":"2015","unstructured":"Yahyaoui, H., Krichen, S., Derbel, B., Talbi, E.G.: A hybrid ILS-VND based hyper-heuristic for permutation flowshop scheduling problem. Procedia Comput. Sci. 60, 632\u2013641 (2015). https:\/\/doi.org\/10.1016\/j.procs.2015.08.199","journal-title":"Procedia Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72904-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T23:05:09Z","timestamp":1617231909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-72904-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030729035","9783030729042"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72904-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2021\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}