{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T11:06:16Z","timestamp":1753182376783},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319076430"},{"type":"electronic","value":"9783319076447"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07644-7_3","type":"book-chapter","created":{"date-parts":[[2014,6,4]],"date-time":"2014-06-04T21:27:11Z","timestamp":1401917231000},"page":"30-44","source":"Crossref","is-referenced-by-count":1,"title":["Algorithm Comparison by Automatically Configurable Stochastic Local Search Frameworks: A Case Study Using Flow-Shop Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Franco","family":"Mascia","sequence":"first","affiliation":[]},{"given":"Manuel","family":"L\u00f3pez-Ib\u00e1\u00f1ez","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00e9mie","family":"Dubois-Lacoste","sequence":"additional","affiliation":[]},{"given":"Marie-\u00c9l\u00e9onore","family":"Marmion","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"3_CR1","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/TEVC.2011.2160401","volume":"16","author":"E.K. Burke","year":"2012","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G.: Grammatical evolution of local search heuristics. IEEE Transactions on Evolutionary Computation\u00a016(7), 406\u2013417 (2012)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V. Cern\u00fd","year":"1985","unstructured":"Cern\u00fd, V.: A thermodynamical approach to the traveling salesman problem. Journal of Optimization Theory and Applications\u00a045(1), 41\u201351 (1985)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3_CR3","volume-title":"Practical Nonparametric Statistics","author":"W.J. Conover","year":"1999","unstructured":"Conover, W.J.: Practical Nonparametric Statistics, 3rd edn. John Wiley & Sons, New York (1999)","edition":"3"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J. Du","year":"1990","unstructured":"Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research\u00a015(3), 483\u2013495 (1990)","journal-title":"Mathematics of Operations Research"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Dubois-Lacoste, J.: A study of Pareto and Two-Phase Local Search Algorithms for Biobjective Permutation Flowshop Scheduling. Master\u2019s thesis, IRIDIA, Universit\u00e9 Libre de Bruxelles, Belgium (2009)","DOI":"10.1007\/978-3-642-04918-7_8"},{"issue":"8","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1016\/j.cor.2010.10.008","volume":"38","author":"J. Dubois-Lacoste","year":"2011","unstructured":"Dubois-Lacoste, J., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems. Computers & Operations Research\u00a038(8), 1219\u20131236 (2011)","journal-title":"Computers & Operations Research"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization\u00a06, 109\u2013113 (1995)","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1162\/evco.2008.16.1.31","volume":"16","author":"A.S. Fukunaga","year":"2008","unstructured":"Fukunaga, A.S.: Automated discovery of local search heuristics for satisfiability testing. Evolutionary Computation\u00a016(1), 31\u201361 (2008)","journal-title":"Evolutionary Computation"},{"key":"3_CR9","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. Mathematics of Operations Research\u00a01, 117\u2013129 (1976)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search \u2013 Part I. INFORMS Journal on Computing\u00a01(3), 190\u2013206 (1989)","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research\u00a0130(3), 449\u2013467 (2001)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"J.N. Hooker","year":"1996","unstructured":"Hooker, J.N.: Testing heuristics: We have it all wrong. Journal of Heuristics\u00a01(1), 33\u201342 (1996)","journal-title":"Journal of Heuristics"},{"key":"3_CR13","volume-title":"Stochastic Local Search\u2014Foundations and Applications","author":"H.H. Hoos","year":"2005","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search\u2014Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2005)"},{"issue":"6","key":"3_CR14","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/s10732-013-9228-8","volume":"19","author":"J. Humeau","year":"2013","unstructured":"Humeau, J., Liefooghe, A., Talbi, E.G., Verel, S.: ParadisEO-MO: From fitness landscape analysis to efficient local search algorithms. Journal of Heuristics\u00a019(6), 881\u2013915 (2013)","journal-title":"Journal of Heuristics"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"D.S. Johnson","year":"1954","unstructured":"Johnson, D.S.: Optimal two- and three-stage production scheduling with setup times included. Naval Research Logistics Quarterly\u00a01, 61\u201368 (1954)","journal-title":"Naval Research Logistics Quarterly"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1090\/dimacs\/059\/11","volume-title":"Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges","author":"D.S. Johnson","year":"2002","unstructured":"Johnson, D.S.: A theoretician\u2019s guide to the experimental analysis of algorithms. In: Goldwasser, M.H., et al. (eds.) Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, pp. 215\u2013250. American Mathematical Society, Providence (2002)"},{"key":"3_CR17","first-page":"517","volume-title":"Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI 2009)","author":"A.R. KhudaBukhsh","year":"2009","unstructured":"KhudaBukhsh, A.R., Xu, L., Hoos, H.H., Leyton-Brown, K.: SATenstein: Automatically building local search SAT solvers from components. In: Boutilier, C. (ed.) Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 517\u2013524. AAAI Press, Menlo Park (2009)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"issue":"6","key":"3_CR19","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1109\/TEVC.2011.2182651","volume":"16","author":"M. L\u00f3pez-Ib\u00e1\u00f1ez","year":"2012","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: The automatic design of multi-objective ant colony optimization algorithms. IEEE Transactions on Evolutionary Computation\u00a016(6), 861\u2013875 (2012)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"3_CR20","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-1-4419-1665-5_12","volume-title":"Handbook of Metaheuristics, ch. 9","author":"H.R. Louren\u00e7o","year":"2010","unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Iterated local search: Framework and applications. In: Gendreau, M., et al. (eds.) Handbook of Metaheuristics, ch. 9, 2nd edn. International Series in Operations Research & Management Science, vol.\u00a0146, pp. 363\u2013397. Springer, New York (2010)","edition":"2"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-38516-2_12","volume-title":"Hybrid Metaheuristics","author":"M.E. 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. LNCS, vol.\u00a07919, pp. 144\u2013158. Springer, Heidelberg (2013)"},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1007\/s10589-010-9384-9","volume":"51","author":"R. Mart\u00ed","year":"2012","unstructured":"Mart\u00ed, R., Reinelt, G., Duarte, A.: A benchmark library and a comparison of heuristic methods for the linear ordering problem. Computational Optimization and Applications\u00a051(3), 1297\u20131317 (2012)","journal-title":"Computational Optimization and Applications"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-44973-4_36","volume-title":"Learning and Intelligent Optimization","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 7. LNCS, vol.\u00a07997, pp. 321\u2013334. Springer, Heidelberg (2013)"},{"key":"3_CR24","doi-asserted-by":"crossref","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. Tech. Rep. TR\/IRIDIA\/2013-015, IRIDIA, Universit\u00e9 Libre de Bruxelles, Belgium (2013)","DOI":"10.1016\/j.cor.2014.05.020"},{"issue":"3","key":"3_CR25","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1287\/ijoc.1070.0258","volume":"20","author":"G. Minella","year":"2008","unstructured":"Minella, G., Ruiz, R., Ciavotta, M.: A review and evaluation of multiobjective algorithms for the flowshop scheduling problem. INFORMS Journal on Computing\u00a020(3), 451\u2013471 (2008)","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"3_CR26","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 Jr., E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA\u00a011(1), 91\u201395 (1983)","journal-title":"OMEGA"},{"issue":"1","key":"3_CR27","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ejor.2012.04.034","volume":"222","author":"Q.K. Pan","year":"2013","unstructured":"Pan, Q.K., Ruiz, R.: Local search methods for the flowshop scheduling problem with flowtime minimization. European Journal of Operational Research\u00a0222(1), 31\u201343 (2013)","journal-title":"European Journal of Operational Research"},{"key":"3_CR28","volume-title":"Combinatorial Optimization \u2013 Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization \u2013 Algorithms and Complexity. Prentice Hall, Englewood Cliffs (1982)"},{"issue":"3","key":"3_CR29","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R. Ruiz","year":"2007","unstructured":"Ruiz, R., St\u00fctzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research\u00a0177(3), 2033\u20132049 (2007)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07644-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T00:24:33Z","timestamp":1558916673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07644-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319076430","9783319076447"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07644-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}