An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates

DOI10.1145/2344422.2344430zbMath1295.90011OpenAlexW2090543144MaRDI QIDQ3189083

Jing Wang, George Karakostas, Stavros G. Kolliopoulos

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2344422.2344430

zbMATH Keywords

schedulingtardinessapproximation algorithmsFPTAS

Mathematics Subject Classification ID

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

Related Items (2)

Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ New results for scheduling to minimize tardiness on one machine with rejection and related problems

This page was built for publication: An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates