{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:44:45Z","timestamp":1743032685119,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774480"},{"type":"electronic","value":"9783319774497"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-77449-7_6","type":"book-chapter","created":{"date-parts":[[2018,3,2]],"date-time":"2018-03-02T10:27:00Z","timestamp":1519986420000},"page":"85-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Automatic Algorithm Configuration for the Permutation Flow Shop Scheduling Problem Minimizing Total Completion Time"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6423-0660","authenticated-orcid":false,"given":"Artur","family":"Brum","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7894-1634","authenticated-orcid":false,"given":"Marcus","family":"Ritt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,3]]},"reference":[{"issue":"6","key":"6_CR1","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1109\/TEVC.2011.2182651","volume":"16","author":"Manuel Lopez-Ibanez","year":"2012","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: The automatic design of multiobjective ant colony optimization algorithms. IEEE Trans. Evol. Comput. 16(6), 861\u2013875 (2012). https:\/\/doi.org\/10.1109\/TEVC.2011.2182651","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/TEVC.2011.2160401","volume":"16","author":"Edmund K. Burke","year":"2012","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G.: Grammatical evolution of local search heuristics. IEEE Trans. Evol. Comput. 16(3), 406\u2013417 (2012). https:\/\/doi.org\/10.1109\/TEVC.2011.2160401","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.artint.2015.11.002","volume":"232","author":"Ashiqur R. KhudaBukhsh","year":"2016","unstructured":"KhudaBukhsh, A.R., Xu, L., Hoos, H.H., Leyton-Brown, K.: Satenstein: automatically building local search SAT solvers from components. Artif. Intell. 232(Supplement C), 20\u201342 (2016). https:\/\/doi.org\/10.1016\/j.artint.2015.11.002","journal-title":"Artificial Intelligence"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/TEVC.2015.2429314","volume":"20","author":"Jurgen Branke","year":"2016","unstructured":"Branke, J., Nguyen, S., Pickardt, C.W., Zhang, M.: Automated design of production scheduling heuristics: a review. IEEE Trans. Evol. Comput. 20(1), 110\u2013124 (2016). https:\/\/doi.org\/10.1109\/TEVC.2015.2429314","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume-title":"Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and V","author":"R.L. Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Hammer, P., Johnson, E., Korte, B. (eds.) Discrete Optimization II, Annals of Discrete Mathematics, vol. 5, pp. 287\u2013326. Elsevier (1979). https:\/\/doi.org\/10.1016\/S0167-5060(08)70356-X"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M. R. 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). https:\/\/doi.org\/10.1287\/moor.1.2.117","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1057\/jors.2010.132","volume":"62","author":"J A V\u00e1zquez-Rodr\u00edguez","year":"2011","unstructured":"V\u00e1zquez-Rodr\u00edguez, J.A., Ochoa, G.: On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming. J. Oper. Res. Soc. 62(2), 381\u2013396 (2011). https:\/\/doi.org\/10.1057\/jors.2010.132","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"6_CR8","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)","journal-title":"Omega"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-44973-4_36","volume-title":"LION 2013","author":"F Mascia","year":"2013","unstructured":"Mascia, F., L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., St\u00fctzle, T.: From grammars to parameters: automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness. In: Nicosia, G., Pardalos, P. (eds.) LION 2013, vol. 7997, pp. 321\u2013334. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-3-642-44973-4_36"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-38516-2_12","volume-title":"HM 2013","author":"ME Marmion","year":"2013","unstructured":"Marmion, M.E., Mascia, F., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Automatic design of hybrid stochastic local search algorithms. In: Blesa, M.J., Blum, C., Festa, P., Roli, A., Sampels, M. (eds.) HM 2013, vol. 7919, pp. 144\u2013158. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38516-2_12"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10710-015-9262-4","volume":"17","author":"Nuno Louren\u00e7o","year":"2016","unstructured":"Louren\u00e7o, N., Pereira, F.B., Costa, E.: Unveiling the properties of structured grammatical evolution. Genetic Program. Evol. Mach. 17(3), 251\u2013289 (2016). https:\/\/doi.org\/10.1007\/s10710-015-9262-4","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: Paramils: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36, 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"6_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"LION 5","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 5. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"Manuel L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3(Supplement C), 43\u201358 (2016). https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","journal-title":"Operations Research Perspectives"},{"issue":"3-4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10710-010-9109-y","volume":"11","author":"Robert I. McKay","year":"2010","unstructured":"McKay, R.I., Hoai, N.X., Whigham, P.A., Shan, Y., O\u2019Neill, M.: Grammar-based genetic programming: a survey. Genetic Program. Evol. Mach. 11(3), 365\u2013396 (2010). https:\/\/doi.org\/10.1007\/s10710-010-9109-y","journal-title":"Genetic Programming and Evolvable Machines"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"Rub\u00e9n Ruiz","year":"2007","unstructured":"Ruiz, R., St\u00fctzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177(3), 2033\u20132049 (2007). https:\/\/doi.org\/10.1016\/j.ejor.2005.12.009","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.cor.2012.08.021","volume":"40","author":"Xingye Dong","year":"2013","unstructured":"Dong, X., Chen, P., Huang, H., Nowak, M.: A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time. Comput. Oper. Res. 40(2), 627\u2013632 (2013). https:\/\/doi.org\/10.1016\/j.cor.2012.08.021","journal-title":"Computers & Operations Research"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953). https:\/\/doi.org\/10.1063\/1.1699114","DOI":"10.1063\/1.1699114"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.cor.2016.12.021","volume":"81","author":"J\u00e9r\u00e9mie Dubois-Lacoste","year":"2017","unstructured":"Dubois-Lacoste, J., Pagnozzi, F., St\u00fctzle, T.: An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem. Comput. Oper. Res. 81, 160\u2013166 (2017). https:\/\/doi.org\/10.1016\/j.cor.2016.12.021","journal-title":"Computers & Operations Research"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0377-2217(01)00278-8","volume":"141","author":"Jose M Framinan","year":"2002","unstructured":"Framinan, J.M., Leisten, R., Ruiz-Usano, R.: Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation. Eur. J. Oper. Res. 141(3), 559\u2013569 (2002). https:\/\/doi.org\/10.1016\/S0377-2217(01)00278-8","journal-title":"European Journal of Operational Research"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Liu, J., Reeves, C.R.: Constructive and composite heuristic solutions to the $${P}\\mid \\mid \\sum {C}_i$$ scheduling problem. Eur. J. Oper. Res. 132(2), 439\u2013452 (2001). https:\/\/doi.org\/10.1016\/S0377-2217(00)00137-5","DOI":"10.1016\/S0377-2217(00)00137-5"},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.omega.2007.02.002","volume":"37","author":"Shahriar Farahmand Rad","year":"2009","unstructured":"Rad, S.F., Ruiz, R., Boroojerdian, N.: New high performing heuristics for minimizing makespan in permutation flowshops. Omega 37(2), 331\u2013345 (2009). https:\/\/doi.org\/10.1016\/j.omega.2007.02.002","journal-title":"Omega"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.cor.2016.12.020","volume":"81","author":"Victor Fernandez-Viagas","year":"2017","unstructured":"Fernandez-Viagas, V., Framinan, J.M.: A beam-search-based constructive heuristic for the PFSP to minimise total flowtime. Comput. Oper. Res. 81(Supplement C), 167\u2013177 (2017). https:\/\/doi.org\/10.1016\/j.cor.2016.12.020","journal-title":"Computers & Operations Research"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Benavides, A.J., Ritt, M.: Iterated local search heuristics for minimizing total completion time in permutation and non-permutation flow shops. In: Proceedings of the Twenty-Fifth International Conference on International Conference on Automated Planning and Scheduling, ICAPS 2015, pp. 34\u201341. AAAI Press (2015)","DOI":"10.1609\/icaps.v25i1.13710"},{"issue":"9","key":"6_CR25","doi-asserted-by":"publisher","first-page":"2638","DOI":"10.1016\/j.cor.2008.11.004","volume":"36","author":"Bassem Jarboui","year":"2009","unstructured":"Jarboui, B., Eddaly, M., Siarry, P.: An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Comput. Oper. Res. 36(9), 2638\u20132646 (2009). https:\/\/doi.org\/10.1016\/j.cor.2008.11.004","journal-title":"Computers & Operations Research"},{"issue":"16","key":"6_CR26","doi-asserted-by":"publisher","first-page":"3459","DOI":"10.1016\/j.ins.2011.04.018","volume":"181","author":"M. Fatih Tasgetiren","year":"2011","unstructured":"Tasgetiren, M.F., Pan, Q.K., Suganthan, P., Chen, A.H.L.: A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Inf. Sci. 181(16), 3459\u20133475 (2011). https:\/\/doi.org\/10.1016\/j.ins.2011.04.018","journal-title":"Information Sciences"},{"issue":"1","key":"6_CR27","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0377-2217(96)00273-1","volume":"103","author":"Chandrasekharan Rajendran","year":"1997","unstructured":"Rajendran, C., Ziegler, H.: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. Eur. J. Oper. Res. 103(1), 129\u2013138 (1997). https:\/\/doi.org\/10.1016\/S0377-2217(96)00273-1","journal-title":"European Journal of Operational Research"},{"key":"6_CR28","unstructured":"Deroussi, L., Gourgand, M., Norre, S.: New effective neighborhoods for the permutation flow shop problem. Technical report LIMOS\/RR-06-09, LIMOS\/ISIMA (2006)"},{"key":"6_CR29","unstructured":"Dubois-Lacoste, J.: Anytime local search for multi-objective combinatorial optimization: design, analysis and automatic configuration. Ph.D. thesis, IRIDIA, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium (2014)"},{"issue":"9","key":"6_CR30","doi-asserted-by":"publisher","first-page":"3001","DOI":"10.1016\/j.cor.2007.01.020","volume":"35","author":"Pawel J. 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":"Computers & Operations Research"},{"issue":"1","key":"6_CR31","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ejor.2008.08.021","volume":"198","author":"Pawel J. 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":"European Journal of Operational Research"},{"key":"6_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmsy.2014.11.011","volume":"35","author":"Dragan Vasiljevic","year":"2015","unstructured":"Vasiljevic, D., Danilovic, M.: Handling ties in heuristics for the permutation flow shop scheduling problem. J. Manuf. Syst. 35(Supplement C), 1\u20139 (2015). https:\/\/doi.org\/10.1016\/j.jmsy.2014.11.011","journal-title":"Journal of Manufacturing Systems"},{"key":"6_CR33","doi-asserted-by":"publisher","unstructured":"Balaprakash, P., Birattari, M., St\u00fctzle, T.: Improvement strategies for the F-race algorithm: sampling design and iterative refinement. In: Bartz-Beielstein, T., et al. (eds.) HM 2007, vol. 4771, pp. 108\u2013122. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75514-2_9","DOI":"10.1007\/978-3-540-75514-2_9"},{"issue":"2","key":"6_CR34","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: 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":"European Journal of Operational Research"},{"issue":"3","key":"6_CR35","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.ejor.2014.07.033","volume":"240","author":"Eva 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":"European Journal of Operational Research"},{"issue":"1","key":"6_CR36","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ejor.2012.04.034","volume":"222","author":"Quan-Ke Pan","year":"2012","unstructured":"Pan, Q.K., Ruiz, R.: Local search methods for the flowshop scheduling problem with flowtime minimization. Eur. J. Oper. Res. 222(1), 31\u201343 (2012). https:\/\/doi.org\/10.1016\/j.ejor.2012.04.034","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77449-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:33:29Z","timestamp":1710354809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77449-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774480","9783319774497"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77449-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"3 March 2018","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","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Parma","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2018\/cfp_evocop.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}