A faster fully polynomial approximation scheme for the single-machine total tardiness problem
Lawler [E.L. Lawler, A fully polynomial approximation scheme for the total tardiness problem, Operations Research Letters 1 (1982) 207208] proposed a fully polynomial approximation scheme for the single-machine total tardiness problem which runs in O n 7 ? time (where n is the number of jobs and ?  is the desired level of approximation). A faster fully polynomial approximation scheme running in O ( n 5 log n + n 5 ? ) time is presented in this note by applying an alternative rounding scheme in conjunction with implementing Kovalyovs [M.Y. Kovalyov, Improving the complexities of approximation algorithms for optimization problems, Operations Research Letters 17 (1995) 8587] bound improvement procedure.
fully polynomial approximation total tardiness single-machine sequencing