Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness

DOI10.1023/A:1015487829051zbMath1014.90039OpenAlexW1489262994MaRDI QIDQ1850992

Mikhail Y. Kovalyov, Frank Werner

Publication date: 15 December 2002

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

Full work available at URL: https://doi.org/10.1023/a:1015487829051

zbMATH Keywords

approximationparallel machine schedulingtotal tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (13)

Optimal due date assignment in multi-machine scheduling environments ⋮ Optimal restricted due date assignment in scheduling ⋮ Scheduling on parallel identical machines to minimize total tardiness ⋮ A common approximation framework for early work, late work, and resource leveling problems ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ Notes on inverse bin-packing problems ⋮ Approximation algorithms for scheduling problems with a modified total weighted tardiness objective ⋮ Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning ⋮ Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties ⋮ Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments ⋮ Fair task allocation problem ⋮ A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines ⋮ Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty

This page was built for publication: Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness