A hybrid algorithm for the single-machine total tardiness problem

DOI10.1016/j.cor.2007.10.002zbMath1163.90005OpenAlexW2116444923MaRDI QIDQ954025

Evgeny R. Gafarov, Cheng, T. C. Edwin, Alexander A. Lazarev

Publication date: 7 November 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/651

zbMATH Keywords

schedulingmeta-heuristics

Mathematics Subject Classification ID

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

Related Items (3)

A theoretical development for the total tardiness problem and its application in branch and bound algorithms ⋮ Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness ⋮ The single-machine total tardiness scheduling problem: review and extensions

Cites Work

• Unnamed Item
• Solution of the single machine total tardiness problem
• A decomposition algorithm for the single machine total tardiness problem
• On decomposition of the total tardiness problem
• A special case of the single-machine total tardiness problem is NP-hard
• Minimizing Total Tardiness on One Machine is NP-Hard
• Solution of the NP-hard total tardiness minimization problem in scheduling theory
• Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
• Algorithmic paradoxes of the single-machine total tardiness problem
• Minimizing total tardiness on a single machine using ant colony optimization

This page was built for publication: A hybrid algorithm for the single-machine total tardiness problem