Evaluating the impact of grammar complexity in automatic algorithm design

[1]  Rubén Ruiz,et al.  A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem , 2008, INFORMS J. Comput..

[2]  Kevin Leyton-Brown,et al.  SATenstein: Automatically Building Local Search SAT Solvers from Components , 2009, IJCAI.

[3]  Thomas Stützle,et al.  Revisiting simulated annealing: A component-based analysis , 2019, Comput. Oper. Res..

[4]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[5]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[6]  Kevin Leyton-Brown,et al.  Quantifying the Similarity of Algorithm Configurations , 2016, LION.

[7]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[8]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  Thomas Stützle,et al.  Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems , 2020, Eur. J. Oper. Res..

[10]  Leslie Pérez Cáceres,et al.  The irace package: Iterated racing for automatic algorithm configuration , 2016 .

[11]  C. Rajendran,et al.  An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .

[12]  Rubén Ruiz,et al.  Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics , 2008, Comput. Oper. Res..

[13]  Kevin Leyton-Brown,et al.  Sequential Model-Based Optimization for General Algorithm Configuration , 2011, LION.

[14]  Jiyin Liu,et al.  Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..

[15]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[16]  Marcus Ritt,et al.  Automatic Design of Heuristics for Minimizing the Makespan in Permutation Flow Shops , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).

[17]  Victor Fernandez-Viagas,et al.  Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness , 2018, Expert Syst. Appl..

[18]  Predrag Janicic,et al.  Instance-Based Selection of Policies for SAT Solvers , 2009, SAT.

[19]  J. Gupta,et al.  Trajectory Scheduling Methods for minimizing total tardiness in a flowshop , 2015 .

[20]  Marcus Ritt,et al.  An Automatically Designed Recombination Heuristic for the Test-Assignment Problem , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).

[21]  Graham Kendall,et al.  Grammatical Evolution of Local Search Heuristics , 2012, IEEE Transactions on Evolutionary Computation.

[22]  Quan-Ke Pan,et al.  Local search methods for the flowshop scheduling problem with flowtime minimization , 2012, Eur. J. Oper. Res..

[23]  Thomas Stützle,et al.  Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools , 2014, Comput. Oper. Res..

[24]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

[25]  Thomas Stützle,et al.  Automatic Configuration of Multi-objective Optimizers and Multi-objective Configuration , 2020, High-Performance Simulation-Based Optimization.

[26]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[27]  Victor Fernandez-Viagas,et al.  On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem , 2014, Comput. Oper. Res..

[28]  Thomas Stützle,et al.  An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem , 2017, Comput. Oper. Res..

[29]  Rubén Ruiz,et al.  New high performing heuristics for minimizing makespan in permutation flowshops , 2009 .

[30]  Yanqi Wang,et al.  Iterated Local Search Algorithms for the Sequence-Dependent Setup Times Flow Shop Scheduling Problem Minimizing Makespan , 2014 .

[31]  Holger H. Hoos,et al.  Programming by optimization , 2012, Commun. ACM.

[32]  Thomas Stützle,et al.  Automatically Designing State-of-the-Art Multi- and Many-Objective Evolutionary Algorithms , 2020, Evolutionary Computation.

[33]  Victor Fernandez-Viagas,et al.  A beam-search-based constructive heuristic for the PFSP to minimise total flowtime , 2017, Comput. Oper. Res..

[34]  Edmund K. Burke,et al.  A Classification of Hyper-Heuristic Approaches: Revisited , 2018, Handbook of Metaheuristics.

[35]  Thomas Stützle,et al.  Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems , 2019, Eur. J. Oper. Res..

[36]  Andrew W. Moore,et al.  The Racing Algorithm: Model Selection for Lazy Learners , 1997, Artificial Intelligence Review.

[37]  Graham Kendall,et al.  Automatic Design of a Hyper-Heuristic Framework With Gene Expression Programming for Combinatorial Optimization Problems , 2015, IEEE Transactions on Evolutionary Computation.

[38]  Korhan Karabulut,et al.  A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops , 2016, Comput. Ind. Eng..

[39]  Sébastien Vérel,et al.  ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms , 2013, Journal of Heuristics.

[40]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .