{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T12:10:27Z","timestamp":1724501427669},"reference-count":49,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1016\/j.ejor.2019.01.018","type":"journal-article","created":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T19:55:24Z","timestamp":1547495724000},"page":"409-421","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":33,"title":["Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems"],"prefix":"10.1016","volume":"276","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-4529-4711","authenticated-orcid":false,"given":"Federico","family":"Pagnozzi","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5820-0473","authenticated-orcid":false,"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"7","key":"10.1016\/j.ejor.2019.01.018_bib0001","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1109\/TEVC.2011.2160401","article-title":"Grammatical evolution of local search heuristics","volume":"16","author":"Burke","year":"2012","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.018_bib0002","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/B:HEUR.0000026900.92269.ec","article-title":"ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics","volume":"10","author":"Cahon","year":"2004","journal-title":"Journal of Heuristics"},{"issue":"5","key":"10.1016\/j.ejor.2019.01.018_bib0003","doi-asserted-by":"crossref","first-page":"1664","DOI":"10.1016\/j.cor.2008.04.001","article-title":"An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion","volume":"36","author":"Dong","year":"2009","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2019.01.018_bib0004","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.cor.2016.12.021","article-title":"An iterated greedy algorithm with optimization of partial solutions for the permutation flowshop problem","volume":"81","author":"Dubois-Lacoste","year":"2017","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2019.01.018_bib0005","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.cor.2013.12.012","article-title":"On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem","volume":"45","author":"Fernandez-Viagas","year":"2014","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2019.01.018_bib0006","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.cor.2016.12.020","article-title":"A beam-search-based constructive heuristic for the PFSP to minimise total flowtime","volume":"81","author":"Fernandez-Viagas","year":"2017","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.018_bib0007","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.ejor.2016.09.055","article-title":"A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation","volume":"257","author":"Fernandez-Viagas","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.018_bib0008","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.eswa.2017.10.050","article-title":"Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness","volume":"94","author":"Fernandez-Viagas","year":"2018","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2019.01.018_bib0009","series-title":"Methods and tools","article-title":"Manufacturing scheduling systems: An integrated view on models","author":"Frami\u00f1\u00e1n","year":"2014"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.018_bib0010","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","article-title":"Variable neighborhood search: Principles and applications","volume":"130","author":"Hansen","year":"2001","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"10.1016\/j.ejor.2019.01.018_bib0011","doi-asserted-by":"crossref","first-page":"2289","DOI":"10.1080\/00207540310001657595","article-title":"Scheduling in flowshops to minimize total tardiness of jobs","volume":"42","author":"Hasija","year":"2004","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.018_bib0012","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009624916728","article-title":"Improved large-step Markov chain variants for the symmetric TSP","volume":"3","author":"Hong","year":"1997","journal-title":"Journal of Heuristics"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.018_bib0013","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/2076450.2076469","article-title":"Programming by optimization","volume":"55","author":"Hoos","year":"2012","journal-title":"Communications of the ACM"},{"key":"10.1016\/j.ejor.2019.01.018_bib0014","series-title":"Stochastic local search\u2014foundations and applications","author":"Hoos","year":"2005"},{"key":"10.1016\/j.ejor.2019.01.018_bib0015","series-title":"Proceedings of the 5th international conference of lecture notes in computer science learning and intelligent optimization, LION 5, volume 6683","first-page":"507","article-title":"Sequential model-based optimization for general algorithm configuration","author":"Hutter","year":"2011"},{"key":"10.1016\/j.ejor.2019.01.018_bib0016","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production scheduling with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/j.ejor.2019.01.018_sbref0017","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.cie.2016.06.012","article-title":"A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops","volume":"98","author":"Karabulut","year":"2016","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/j.ejor.2019.01.018_bib0018","series-title":"Proceedings of the twenty-first international joint conference on artificial intelligence (IJCAI-09)","first-page":"517","article-title":"SATenstein: Automatically building local search SAT solvers from components","author":"KhudaBukhsh","year":"2009"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.018_bib0019","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1057\/jors.1993.3","article-title":"Heuristics for flowshop scheduling problems minimizing mean tardiness","volume":"44","author":"Kim","year":"1993","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2019.01.018_bib0020","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.orp.2014.12.001","article-title":"Trajectory scheduling methods for minimizing total tardiness in a flowshop","volume":"2","author":"Li","year":"2015","journal-title":"Operations Research Perspectives"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.018_bib0021","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.ejor.2013.10.024","article-title":"A unified ant colony optimization algorithm for continuous optimization","volume":"234","author":"Liao","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.018_bib0022","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/S0377-2217(00)00137-5","article-title":"Constructive and composite heuristic solutions to the P\/\/\u03a3Ci scheduling problem","volume":"132","author":"Liu","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.018_bib0023","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","article-title":"The irace package: Iterated racing for automatic algorithm configuration","volume":"3","author":"L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","journal-title":"Operations Research Perspectives"},{"key":"10.1016\/j.ejor.2019.01.018_bib0024","unstructured":"M. L\u00f3pez-Ib\u00e1\u00f1ez, K. Marie-El\u00e9onore, and T. St\u00fctzle, Automatic design of hybrid metaheuristics from algorithmic components, Tech. Rep. TR\/IRIDIA\/2017-012, IRIDIA, Universit\u00e9 Libre de Bruxelles, Belgium (Dec. 2017), http:\/\/iridia.ulb.ac.be\/IridiaTrSeries\/link\/IridiaTr2017-012.pdf."},{"issue":"6","key":"10.1016\/j.ejor.2019.01.018_bib0025","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1109\/TEVC.2011.2182651","article-title":"The automatic design of multi-objective ant colony optimization algorithms","volume":"16","author":"L\u00f3pez-Ib\u00e1\u00f1ez","year":"2012","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/j.ejor.2019.01.018_sbref0026","series-title":"Handbook of metaheuristics, volume 146 of international series in operations research & management science, chapter\u00a09","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/978-1-4419-1665-5_12","article-title":"Iterated local search: Framework and applications","author":"Louren\u00e7o","year":"2010"},{"key":"10.1016\/j.ejor.2019.01.018_bib0027","series-title":"Hybrid metaheuristics, volume 7919 of lecture notes in computer science","first-page":"144","article-title":"Automatic design of hybrid stochastic local search algorithms","author":"Marmion","year":"2013"},{"key":"10.1016\/j.ejor.2019.01.018_bib0028","series-title":"Proceedings of the 7th international conference learning and intelligent optimization, LION 7, volume 7997 of lecture notes in computer science","first-page":"321","article-title":"From grammars to parameters: Automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness","author":"Mascia","year":"2013"},{"key":"10.1016\/j.ejor.2019.01.018_bib0029","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/j.cor.2014.05.020","article-title":"Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools","volume":"51","author":"Mascia","year":"2014","journal-title":"Computers & Operations Research"},{"issue":"3\u20134","key":"10.1016\/j.ejor.2019.01.018_bib0030","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10710-010-9109-y","article-title":"Grammar-based genetic programming: A survey","volume":"11","author":"Mckay","year":"2010","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"10.1016\/j.ejor.2019.01.018_bib0031","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation of state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"Journal of Chemical Physics"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.018_bib0032","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1287\/ijoc.1070.0258","article-title":"A review and evaluation of multiobjective algorithms for the flowshop scheduling problem","volume":"20","author":"Minella","year":"2008","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.018_bib0033","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"Omega"},{"key":"10.1016\/j.ejor.2019.01.018_bib0034","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1007\/s11590-016-1086-5","article-title":"Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem","volume":"11","author":"Pagnozzi","year":"2017","journal-title":"Optimization Letters"},{"key":"10.1016\/j.ejor.2019.01.018_bib0035","unstructured":"Pagnozzi, F., & St\u00fctzle, T. (2018). Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems: Supplementary material. http:\/\/iridia.ulb.ac.be\/supp\/IridiaSupp2018-002\/."},{"issue":"1","key":"10.1016\/j.ejor.2019.01.018_bib0036","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2012.04.034","article-title":"Local search methods for the flowshop scheduling problem with flowtime minimization","volume":"222","author":"Pan","year":"2012","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.018_bib0037","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/j.cie.2008.03.003","article-title":"A discrete differential evolution algorithm for the permutation flowshop scheduling problem","volume":"55","author":"Pan","year":"2008","journal-title":"Computers and Industrial Engineering"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.018_bib0038","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.omega.2007.02.002","article-title":"New high performing heuristics for minimizing makespan in permutation flowshops","volume":"37","author":"Rad","year":"2009","journal-title":"Omega"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.018_bib0039","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0377-2217(96)00273-1","article-title":"An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs","volume":"103","author":"Rajendran","year":"1997","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.018_bib0040","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","article-title":"Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/total flowtime of jobs","volume":"155","author":"Rajendran","year":"2004","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.018_bib0041","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","article-title":"A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem","volume":"177","author":"Ruiz","year":"2007","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.018_bib0042","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","article-title":"Some efficient heuristic methods for the flow shop sequencing problem","volume":"47","author":"Taillard","year":"1990","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.018_bib0043","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.018_bib0044","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","article-title":"A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem","volume":"177","author":"Tasgetiren","year":"2007","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.018_bib0045","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.ejor.2008.08.023","article-title":"A hybrid genetic local search algorithm for the permutation flowshop scheduling problem","volume":"198","author":"Tseng","year":"2009","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2019.01.018_bib0046","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.omega.2009.04.002","article-title":"Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem","volume":"38","author":"Vallada","year":"2010","journal-title":"Omega"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.018_bib0047","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/j.ejor.2014.07.033","article-title":"New hard benchmark for flowshop scheduling problems minimising makespan","volume":"240","author":"Vallada","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.018_bib0048","doi-asserted-by":"crossref","first-page":"1350","DOI":"10.1016\/j.cor.2006.08.016","article-title":"Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics","volume":"35","author":"Vallada","year":"2008","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.018_bib0049","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/0377-2217(95)00347-9","article-title":"Heuristic approaches for n\/m\/F\/\u03a3Ci scheduling problems","volume":"96","author":"Wang","year":"1997","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300207?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300207?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T07:28:55Z","timestamp":1551943735000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221719300207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["S0377221719300207"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.018","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.018","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}