Automatic algorithm design for hybrid flowshop scheduling problems
From MaRDI portal
Publication:2286868
DOI10.1016/j.ejor.2019.10.004zbMath1431.90062OpenAlexW2980010855WikidataQ127121660 ScholiaQ127121660MaRDI QIDQ2286868
Pedro Alfaro-Fernández, Federico Pagnozzi, Thomas Stützle, Rubén Ruiz
Publication date: 23 January 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/296900/3/EJOR-D-18-00854R2PaperOnly.pdf
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows ⋮ Shop scheduling in manufacturing environments: a review ⋮ Evaluating the impact of grammar complexity in automatic algorithm design ⋮ A best possible online algorithm for minimizing the total completion time and the total soft penalty cost ⋮ A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
- An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
- Bounding strategies for the hybrid flow shop scheduling problem
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- The hybrid flow shop scheduling problem
- Flowshop scheduling research after five decades
- SATenstein: automatically building local search SAT solvers from components
- Optimal two- and three-stage production schedules with setup times included
- Experimental Methods for the Analysis of Optimization Algorithms
- ParamILS: An Automatic Algorithm Configuration Framework
- Two-Stage, Hybrid Flowshop Scheduling Problem
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
- An Exact Method for Solving the Multi-Processor Flow-Shop
- Metaheuristics—the metaphor exposed
- Manufacturing Scheduling Systems
