A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

• Published in: Theoretical computer science Vol. 369; no. 1; pp. 230 - 238
• Main Authors: Kellerer, Hans, Strusevich, Vitaly A.
• Format: Journal Article
• Language: English; German
• Published: Amsterdam Elsevier B.V 15.12.2006; Elsevier
• Subjects: Algorithmics. Computability. Computer arithmetics; Applied sciences; Computer science; control theory; systems; Computer systems performance. Reliability; Dynamic programming; Exact sciences and technology; FPTAS; Mathematical programming; Mathematics; Numerical analysis; Numerical analysis. Scientific computation; Numerical approximation; Operational research and scientific management; Operational research. Management science; Sciences and techniques of general use; Single machine scheduling; Software; Theoretical computing; Weighted total tardiness; Weighted total tardiness; Dynamic programming; FPTAS; Single machine scheduling; Computer theory; Polynomial approximation; Scheduling; Algorithm; Due date; Single machine; Polynomial time
• ISSN: 0304-3975; 1879-2294
• DOI: 10.1016/j.tcs.2006.08.030

We develop a fully polynomial-time approximation scheme (FPTAS) for minimizing the weighted total tardiness on a single machine, provided that all due dates are equal. The FPTAS is obtained by converting an especially designed pseudopolynomial dynamic programming algorithm.