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

European Journal of Operational Research

Volumn 193, Issue 2, 2009, Pages 637-638

  Koulamas, Christos ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

Fully polynomial approximation; Single machine sequencing; Total tardiness

Indexed keywords

APPROXIMATION THEORY; INDUSTRIAL ENGINEERING; MANAGEMENT SCIENCE; POLYNOMIALS;

APPROXIMATION SCHEMES; FULLY POLYNOMIAL APPROXIMATION; SINGLE MACHINES; SINGLE-MACHINE SEQUENCING; TOTAL TARDINESS;

POLYNOMIAL APPROXIMATION;

EID: 53049096999     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.12.031     Document Type: Article

References (8)

1. Chang S., Lu Q., Tang G., and Yu W. On decomposition of the total tardiness problem. Operations Research Letters 17 (1995) 221-229
2. Della Croce F., Grosso A., and Paschos V. Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem. Journal of Scheduling 7 (2004) 85-91
3. Du J., and Leung J.Y.-T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15 (1990) 483-495
4. Kovalyov M.Y. Improving the complexities of approximation algorithms for optimization problems. Operations Research Letters 17 (1995) 85-87
5. Lawler E.L. A 'pseudo-polynomial' algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1 (1977) 331-342
6. Lawler E.L. A fully polynomial approximation scheme for the total tardiness problem. Operations Research Letters 1 (1982) 207-208
7. Potts C.N., and Van Wassenhove L.N. A decomposition algorithm for the single-machine total tardiness problem. Operations Research Letters 1 (1982) 177-181
8. Szwarc W. Some remarks on the decomposition properties of the single-machine total tardiness problem. European Journal of Operational Research 177 (2007) 623-625