A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times
From MaRDI portal
Publication:1761176
DOI10.1016/j.cor.2011.12.017zbMath1251.90189OpenAlexW2002100181MaRDI QIDQ1761176
Marc Gravel, Caroline Gagné, Aymen Sioud
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.12.017
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect ⋮ Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates ⋮ Total completion time with makespan constraint in no-wait flowshops with setup times ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints ⋮ Multi-objective Optimal Design of Nonlinear Controls ⋮ ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness ⋮ Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
Uses Software
Cites Work
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- Hybridizing exact methods and metaheuristics: a taxonomy
- Scheduling in a sequence dependent setup environment with genetic search
- Scheduling with batching: A review
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- A survey of scheduling problems with setup times or costs
- Minimizing Total Tardiness on One Machine is NP-Hard
- An Introduction to Metaheuristic Techniques
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
- Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
- A memetic algorithm for the total tardiness single machine scheduling problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times