Approximation algorithms for minimizing the total weighted tardiness on a single machine

Theoretical Computer Science

Volumn 355, Issue 3, 2006, Pages 261-273

  Kolliopoulos, Stavros G ^a   Steiner, George ^b  

^a UNIVERSITY OF ATHENS   (Greece)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

Approximation algorithms; Scheduling; Weighted tardiness

Indexed keywords

ERROR ANALYSIS; POLYNOMIAL APPROXIMATION; SCHEDULING;

APPROXIMATION ALGORITHMS; PSEUDOPOLYNOMIAL ALGORITHM; WEIGHTED TARDINESS;

ALGORITHMS;

EID: 33644880309     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.11.039     Document Type: Article

References (15)

1. T.C.E. Cheng, C.T. Ng, J.J. Yuan, and Z.H. Liu Single machine scheduling to minimize total weighted tardiness European J. Oper. Res. 165 2005 423 443
2. R.K. Congram, C.N. Potts, and S.L. van de Velde An iterated dynasearch algorithm for the signal-machine total weighted tardiness scheduling problem INFORMS J. Comput. 14 1 2002 52 67
3. J. Du, and J.Y.-T. Leung Minimizing total tardiness on one machine is NP-hard Math. Oper. Res. 15 1990 483 495
4. G. Hardy, J.E. Littlewood, and G. Pólya Inequalities second ed. 1952 Cambridge University Press Cambridge
5. A.M.A. Hariri, C.N. Potts, and L.N. Van Wassenhowe Single machine scheduling to minimize total weighted late work ORSA J. Comput. 7 1995 232 242
6. J.R. Jackson, Scheduling a production line to minimize maxmimum tardiness, Research Report 43, Management Science Research Project, UCLA, 1955.
7. S.G. Kolliopoulos, and G. Steiner On minimizing the total weighted tardiness on a single machine V. Diekert M. Habib Proc. of the 21st Annual Internat. Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science Vol. 2996 2004 Springer Berlin 176 186
8. M.Y. Kovalyov, C.N. Potts, and L.N. Van Wassenhove A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work Math. Oper. Res. 19 1994 86 93
9. E.L. Lawler A "pseudopolynomial" algorithm for sequencing jobs to minimize total tardiness Ann. Discrete Math. 1 1977 331 342
10. E.L. Lawler A fully polynomial approximation scheme for the total tardiness problem Oper. Res. Lett. 1 1982 207 208
11. E.L. Lawler, and J.M. Moore A functional equation and its application to resource allocation and sequencing problem Management Sci. 16 1969 77 84
12. J.K. Lenstra, A.H.G.R. Kan, and P. Brucker Complexity of machine scheduling problems Ann. Discrete Math. 1 1977 343 362
13. R. McNaughton Scheduling with deadlines and loss functions Management Sci. 6 1959 1 12
14. C.N. Potts, and L.N. Van Wassenhove Single machine scheduling to minimize total late work Oper. Res. 40 1992 586 595
15. J. Yuan The NP-hardness of the single machine common due date weighted tardiness problem Syst. Sci. Math. Sci. 5 1992 328 333