Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem

DOI10.1023/B:JOSH.0000013056.09936.fdzbMath1154.90438OpenAlexW2086104103MaRDI QIDQ5920391

Vangelis Th. Paschos, Andrea Grosso, Frederico Della Croce

Publication date: 20 December 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:josh.0000013056.09936.fd

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty