A fully polynomial approximation scheme for the total tardiness problem

Authors:
E. L. Lawler
Affiliations:
Computer Science Division, University of California at Berkeley, Berkeley, CA 94720, U.S.A.
Venue:
Operations Research Letters
Year:
1982

Citing 0
Cited 6

Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem

Mathematical and Computer Modelling: An International Journal
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective

Operations Research Letters
Improving the complexities of approximation algorithms for optimization problems

Operations Research Letters
Approximation algorithms for scheduling a single machine to minimize total late work

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

ACM Transactions on Algorithms (TALG)
A theoretical development for the total tardiness problem and its application in branch and bound algorithms

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fully polynomial approximation scheme is presented for the problem of sequencing jobs for processing by a single machine so as to minimize total tardiness. This result is obtained by modifying the author's pseudopolynomial algorithm for the same problem.