Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times

DOI10.1057/palgrave.jors.2601390zbMath1130.90326OpenAlexW2018739257MaRDI QIDQ4656697

Marc Gravel, Caroline Gagné, Wilson L. Price

Publication date: 14 March 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601390

zbMATH Keywords

schedulingsingle machinemetaheuristicant colony optimizationtotal tardinesssequence-dependent setups

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (26)

Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem ⋮ A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times ⋮ Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups ⋮ An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups ⋮ A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times ⋮ Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness ⋮ Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups ⋮ Algorithms for single machine total tardiness scheduling with sequence dependent setups ⋮ Multiple colony ant algorithm for job-shop scheduling problem ⋮ A GRASP based on DE to solve single machine scheduling problem with SDST ⋮ Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach ⋮ Ant colony optimization combined with taboo search for the job shop scheduling problem ⋮ ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness ⋮ A survey of scheduling problems with setup times or costs ⋮ A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times ⋮ Makespan minimization on single batch-processing machine via ant colony optimization ⋮ A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine ⋮ A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times ⋮ Ant colony optimization for continuous domains ⋮ A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times ⋮ Scheduling of tasks with effectiveness precedence constraints ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Ant colony optimization theory: a survey

This page was built for publication: Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times