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

Burke, 2012, Grammatical evolution of local search heuristics, IEEE Transactions on Evolutionary Computation, 16, 406, 10.1109/TEVC.2011.2160401 Cahon, 2004, ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics, Journal of Heuristics, 10, 357, 10.1023/B:HEUR.0000026900.92269.ec Dong, 2009, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion, Computers & Operations Research, 36, 1664, 10.1016/j.cor.2008.04.001 Dubois-Lacoste, 2017, An iterated greedy algorithm with optimization of partial solutions for the permutation flowshop problem, Computers & Operations Research, 81, 160, 10.1016/j.cor.2016.12.021 Fernandez-Viagas, 2014, On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem, Computers & Operations Research, 45, 60, 10.1016/j.cor.2013.12.012 Fernandez-Viagas, 2017, A beam-search-based constructive heuristic for the PFSP to minimise total flowtime, Computers & Operations Research, 81, 167, 10.1016/j.cor.2016.12.020 Fernandez-Viagas, 2017, A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation, European Journal of Operational Research, 257, 707, 10.1016/j.ejor.2016.09.055 Fernandez-Viagas, 2018, Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness, Expert Systems with Applications, 94, 58, 10.1016/j.eswa.2017.10.050 Framiñán, 2014, Manufacturing scheduling systems: An integrated view on models Hansen, 2001, Variable neighborhood search: Principles and applications, European Journal of Operational Research, 130, 449, 10.1016/S0377-2217(00)00100-4 Hasija, 2004, Scheduling in flowshops to minimize total tardiness of jobs, International Journal of Production Research, 42, 2289, 10.1080/00207540310001657595 Hong, 1997, Improved large-step Markov chain variants for the symmetric TSP, Journal of Heuristics, 3, 63, 10.1023/A:1009624916728 Hoos, 2012, Programming by optimization, Communications of the ACM, 55, 70, 10.1145/2076450.2076469 Hoos, 2005 Hutter, 2011, Sequential model-based optimization for general algorithm configuration, 507 Johnson, 1954, Optimal two- and three-stage production scheduling with setup times included, Naval Research Logistics Quarterly, 1, 61, 10.1002/nav.3800010110 Karabulut, 2016, A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops, Computers and Industrial Engineering, 98, 300, 10.1016/j.cie.2016.06.012 KhudaBukhsh, 2009, SATenstein: Automatically building local search SAT solvers from components, 517 Kim, 1993, Heuristics for flowshop scheduling problems minimizing mean tardiness, Journal of the Operational Research Society, 44, 19, 10.1057/jors.1993.3 Li, 2015, Trajectory scheduling methods for minimizing total tardiness in a flowshop, Operations Research Perspectives, 2, 13, 10.1016/j.orp.2014.12.001 Liao, 2014, A unified ant colony optimization algorithm for continuous optimization, European Journal of Operational Research, 234, 597, 10.1016/j.ejor.2013.10.024 Liu, 2001, Constructive and composite heuristic solutions to the P//ΣCi scheduling problem, European Journal of Operational Research, 132, 439, 10.1016/S0377-2217(00)00137-5 López-Ibáñez, 2016, The irace package: Iterated racing for automatic algorithm configuration, Operations Research Perspectives, 3, 43, 10.1016/j.orp.2016.09.002 M. López-Ibáñez, K. Marie-Eléonore, and T. Stützle, Automatic design of hybrid metaheuristics from algorithmic components, Tech. Rep. TR/IRIDIA/2017-012, IRIDIA, Université Libre de Bruxelles, Belgium (Dec. 2017), http://iridia.ulb.ac.be/IridiaTrSeries/link/IridiaTr2017-012.pdf. López-Ibáñez, 2012, The automatic design of multi-objective ant colony optimization algorithms, IEEE Transactions on Evolutionary Computation, 16, 861, 10.1109/TEVC.2011.2182651 Lourenço, 2010, Iterated local search: Framework and applications, 363, 10.1007/978-1-4419-1665-5_12 Marmion, 2013, Automatic design of hybrid stochastic local search algorithms, 144 Mascia, 2013, From grammars to parameters: Automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness, 321 Mascia, 2014, Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools, Computers & Operations Research, 51, 190, 10.1016/j.cor.2014.05.020 Mckay, 2010, Grammar-based genetic programming: A survey, Genetic Programming and Evolvable Machines, 11, 365, 10.1007/s10710-010-9109-y Metropolis, 1953, Equation of state calculations by fast computing machines, Journal of Chemical Physics, 21, 1087, 10.1063/1.1699114 Minella, 2008, A review and evaluation of multiobjective algorithms for the flowshop scheduling problem, INFORMS Journal on Computing, 20, 451, 10.1287/ijoc.1070.0258 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 Pagnozzi, 2017, Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem, Optimization Letters, 11, 1283, 10.1007/s11590-016-1086-5 Pagnozzi, F., & Stützle, T. (2018). Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems: Supplementary material. http://iridia.ulb.ac.be/supp/IridiaSupp2018-002/. Pan, 2012, Local search methods for the flowshop scheduling problem with flowtime minimization, European Journal of Operational Research, 222, 31, 10.1016/j.ejor.2012.04.034 Pan, 2008, A discrete differential evolution algorithm for the permutation flowshop scheduling problem, Computers and Industrial Engineering, 55, 795, 10.1016/j.cie.2008.03.003 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, European Journal of Operational Research, 103, 129, 10.1016/S0377-2217(96)00273-1 Rajendran, 2004, Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs, European Journal of Operational Research, 155, 426, 10.1016/S0377-2217(02)00908-6 Ruiz, 2007, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, 177, 2033, 10.1016/j.ejor.2005.12.009 Taillard, 1990, Some efficient heuristic methods for the flow shop sequencing problem, European Journal of Operational Research, 47, 65, 10.1016/0377-2217(90)90090-X Taillard, 1993, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M Tasgetiren, 2007, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, European Journal of Operational Research, 177, 1930, 10.1016/j.ejor.2005.12.024 Tseng, 2009, A hybrid genetic local search algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, 198, 84, 10.1016/j.ejor.2008.08.023 Vallada, 2010, Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem, Omega, 38, 57, 10.1016/j.omega.2009.04.002 Vallada, 2015, New hard benchmark for flowshop scheduling problems minimising makespan, European Journal of Operational Research, 240, 666, 10.1016/j.ejor.2014.07.033 Vallada, 2008, Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics, Computers & Operations Research, 35, 1350, 10.1016/j.cor.2006.08.016 Wang, 1997, Heuristic approaches for n/m/F/ΣCi scheduling problems, European Journal of Operational Research, 96, 636, 10.1016/0377-2217(95)00347-9