A faster fully polynomial approximation scheme for the single-machine total tardiness problem

• Published in: European journal of operational research Vol. 193; no. 2; pp. 637 - 638
• Main Author: Koulamas, Christos
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.03.2009; Elsevier
• Series: European Journal of Operational Research
• Subjects: Applied sciences; Exact sciences and technology; Fully polynomial approximation; Mathematical programming; Operational research and scientific management; Operational research. Management science; Single-machine sequencing; Single-machine sequencing Total tardiness Fully polynomial approximation; Total tardiness; Fully polynomial approximation; Total tardiness; Single-machine sequencing; Operations research; Polynomial approximation; Algorithm complexity; Rounding error; Approximation algorithm; Sequencing; Single machine; Delay; Mathematical programming
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/j.ejor.2007.12.031

Lawler [E.L. Lawler, A fully polynomial approximation scheme for the total tardiness problem, Operations Research Letters 1 (1982) 207–208] 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 Kovalyov’s [M.Y. Kovalyov, Improving the complexities of approximation algorithms for optimization problems, Operations Research Letters 17 (1995) 85–87] bound improvement procedure.