Evaluating the impact of grammar complexity in automatic algorithm design
From MaRDI portal
Publication:6082176
DOI10.1111/itor.12902OpenAlexW3105960754MaRDI QIDQ6082176
Federico Pagnozzi, Thomas Stützle
Publication date: 29 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/314418/3/paper.pdf
Cites Work
- Unnamed Item
- Unnamed Item
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- Revisiting simulated annealing: a component-based analysis
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Automatic algorithm design for hybrid flowshop scheduling problems
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- Benchmarks for basic scheduling problems
- SATenstein: automatically building local search SAT solvers from components
- Optimal two- and three-stage production schedules with setup times included
- A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
- Equation of State Calculations by Fast Computing Machines
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
This page was built for publication: Evaluating the impact of grammar complexity in automatic algorithm design