A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs

DOI10.1057/palgrave.jors.2601906zbMath1274.90508OpenAlexW1991370671MaRDI QIDQ5313400

Chandrasekharan Rajendran, Oliver Holthaus

Publication date: 1 September 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.2601906

Mathematics Subject Classification ID

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

Related Items (7)

Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem ⋮ An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands ⋮ An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed ⋮ An ant colony optimisation algorithm for scheduling in agile manufacturing ⋮ Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem ⋮ A population-based variable neighborhood search for the single machine total weighted tardiness problem ⋮ Interval-indexed formulation based heuristics for single machine total weighted tardiness problem

This page was built for publication: A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs