Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems with additional constraints

Baptiste, 1997, A branch and bound algorithm for the f/no_idle/cmax, 429 Bezerra, 2016, Automatic component-wise design of multi-objective evolutionary algorithms, IEEE Trans Evol Comput, 20, 403, 10.1109/TEVC.2015.2474158 Bezerra, 2018, A large-scale experimental evaluation of high-performing multi- and many-objective evolutionary algorithms, Evol Comput, 26, 621, 10.1162/evco_a_00217 Bezerra, 2020, Automatic configuration of multi-objective optimizers and multi-objective configuration, 69 Branke, 2016, Automated design of production scheduling heuristics: a review, IEEE Trans Evol Comput, 20, 110, 10.1109/TEVC.2015.2429314 Brum, 2018, Automatic design of heuristics for minimizing the makespan in permutation flow shops, 1 Brum, 2018, Automatic algorithm configuration for the permutation flow shop scheduling problem minimizing total completion time, 85 Burke, 2012, Grammatical evolution of local search heuristics, IEEE Trans Evol Comput, 16, 406, 10.1109/TEVC.2011.2160401 Burke, 2019, A classification of hyper-heuristic approaches: Revisited, 453, 10.1007/978-3-319-91086-4_14 Cahon, 2004, ParadisEO: a framework for the reusable design of parallel and distributed metaheuristics, J Heuristics, 10, 357, 10.1023/B:HEUR.0000026900.92269.ec De Souza, 2018, Automatic grammar-based design of heuristic algorithms for unconstrained binary quadratic programming, 67 De Souza, 2018, An automatically designed recombination heuristic for the test-assignment problem, 1 Fernandez-Viagas, 2014, On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem, Comput Oper Res, 45, 60, 10.1016/j.cor.2013.12.012 Framiñán, 2014 Franzin, 2019, Revisiting simulated annealing: a component-based analysis, Comput Oper Res, 104, 191, 10.1016/j.cor.2018.12.015 Fukunaga, 2004, Evolving local search heuristics for SAT using genetic programming, 483 Fukunaga, 2008, Automated discovery of local search heuristics for satisfiability testing, Evol Comput, 16, 31, 10.1162/evco.2008.16.1.31 Gupta, 1986, Flowshop schedules with sequence dependent setup times, J Oper Res SocJpn, 29, 206 Hart, 2016, A hyper-heuristic ensemble method for static job-shop scheduling, Evol Comput, 24, 609, 10.1162/EVCO_a_00183 Hoos, 2005 Hutter, 2011, Sequential model-based optimization for general algorithm configuration, 507 Hutter, 2007, Automatic algorithm configuration based on local search, 1152 Johnson, 1954, Optimal two- and three-stage production scheduling with setup times included, Nav Res Logist Q, 1, 61, 10.1002/nav.3800010110 Karabulut, 2016, A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops, Comput Ind Eng, 98, 300, 10.1016/j.cie.2016.06.012 Keller, 2007, Linear genetic programming of parsimonious metaheuristics, 4508 Keller, 2008, Cost-benefit investigation of a genetic-programming hyperheuristic, 13 KhudaBukhsh, 2016, SATenstein: automatically building local search SAT solvers from components, Artif Intell, 232, 20, 10.1016/j.artint.2015.11.002 Kim, 1993, Heuristics for flowshop scheduling problems minimizing mean tardiness, J Oper Res Soc, 44, 19, 10.1057/jors.1993.3 Koza, 1992 Li, 2012, Adaptive hybrid algorithms for the sequence-dependent setup time permutation flow shop scheduling problem, IEEE Trans Autom SciEng, 9, 578, 10.1109/TASE.2012.2192729 Liu, 2001, Constructive and composite heuristic solutions to the P//ΣCi scheduling problem, Eur J Oper Res, 132, 439, 10.1016/S0377-2217(00)00137-5 López-Ibáñez, 2012, The automatic design of multi-objective ant colony optimization algorithms, IEEE Trans Evol Comput, 16, 861, 10.1109/TEVC.2011.2182651 López-Camacho, 2014, A unified hyper-heuristic framework for solving bin packing problems, Expert Syst Appl, 41, 6876, 10.1016/j.eswa.2014.04.043 López-Ibáñez, 2016, The irace package: iterated racing for automatic algorithm configuration, Oper Res Perspect, 3, 43 López-Ibáñez, M., Kessaci, M.-E., & Stützle, T.. Automatic design of hybrid metaheuristics from algorithmic components, submitted. Marmion, 2013, Automatic design of hybrid stochastic local search algorithms, 144 Mascia, 2014, Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools, Comput Oper Res, 51, 190, 10.1016/j.cor.2014.05.020 Metropolis, 1953, Equation of state calculations by fast computing machines, J Chem Phys, 21, 1087, 10.1063/1.1699114 Minella, 2008, A review and evaluation of multiobjective algorithms for the flowshop scheduling problem, INFORMS J Comput, 20, 451, 10.1287/ijoc.1070.0258 Nagano, 2019, High-performing heuristics to minimize flowtime in no-idle permutation flowshop, Eng Optim, 51, 185, 10.1080/0305215X.2018.1444163 Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega, 11, 91, 10.1016/0305-0483(83)90088-9 O’Neill, 2001, Grammatical evolution, IEEE Trans Evol Comput, 5, 349, 10.1109/4235.942529 Pagnozzi, 2019, Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems, Eur J Oper Res, 276, 409, 10.1016/j.ejor.2019.01.018 Pagnozzi, F., & Stützle, T. (2019b). Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems with additional constraints: Supplementary material. http://iridia.ulb.ac.be/supp/IridiaSupp2019-007/. Pan, 2014, An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem, Omega, 44, 41, 10.1016/j.omega.2013.10.002 Pinedo, 2012 Rad, 2009, New high performing heuristics for minimizing makespan in permutation flowshops, Omega, 37, 331, 10.1016/j.omega.2007.02.002 Rajendran, 1997, An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs, Eur J Oper Res, 103, 129, 10.1016/S0377-2217(96)00273-1 Ruiz, 2005, A comprehensive review and evaluation of permutation flowshop heuristics, Eur J Oper Res, 165, 479, 10.1016/j.ejor.2004.04.017 Ruiz, 2006, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, Eur J Oper Res, 169, 781, 10.1016/j.ejor.2004.06.038 Ruiz, 2008, An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives, Eur J Oper Res, 187, 1143, 10.1016/j.ejor.2006.07.029 Ruiz, 2007, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, Eur J Oper Res, 177, 2033, 10.1016/j.ejor.2005.12.009 Ruiz, 2009, Scheduling in flowshops with no-idle machines, 21 Sabar, 2013, Grammatical evolution hyper-heuristic for combinatorial optimization problems, IEEE Trans Evol Comput, 17, 840, 10.1109/TEVC.2013.2281527 Shao, 2017, Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion, Appl Soft Comput, 54, 164, 10.1016/j.asoc.2017.01.017 Shao, 2018, A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion, Comput Oper Res, 94, 89, 10.1016/j.cor.2018.02.003 Sim, 2015, A lifelong learning hyper-heuristic method for bin packing, Evol Comput, 23, 37, 10.1162/EVCO_a_00121 Sioud, 2018, Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times, Eur J Oper Res, 264, 66, 10.1016/j.ejor.2017.06.027 Stützle, 2019, Automated design of metaheuristic algorithms, 541, 10.1007/978-3-319-91086-4_17 Taillard, 1993, Benchmarks for basic scheduling problems, Eur J Oper Res, 64, 278, 10.1016/0377-2217(93)90182-M Tasgetiren, 2013, A general variable neighborhood search algorithm for the no-idle permutation flowshop scheduling problem, 24 Tasgetiren, 2013, A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem, Comput Oper Res, 40, 1729, 10.1016/j.cor.2013.01.005 Tavares, 2012, Automatic design of ant algorithms with grammatical evolution, 206 Vallada, 2008, Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics, Comput Oper Res, 35, 1350, 10.1016/j.cor.2006.08.016 Wang, 2014, Iterated local search algorithms for the sequence-dependent setup times flow shop scheduling problem minimizing makespan, 329