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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5609 LNCS, Issue , 2009, Pages 238-248

  Karakostas, George ^a   Kolliopoulos, Stavros G ^b   Wang, Jing ^c  

^a MCMASTER UNIVERSITY   (Canada)

^b UNIVERSITY OF ATHENS   (Greece)

^c MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMMON DUE DATE; DUE DATES; FIXED NUMBERS; PROCESSING TIME; SCHEDULING PROBLEM; SINGLE MACHINES; TOTAL-WEIGHTED TARDINESS;

EID: 76249116142     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02882-3_24     Document Type: Conference Paper

References (11)

1. Abdul-Razaq, T.S., Potts, C.N., Van Wassenhove, L.N.: A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Applied Mathematics 26, 235-253 (1990)
2. Cheng, T.C.E., Ng, C.T., Yuan, J.J., Liu, Z.H.: Single machine scheduling to minimize total weighted tardiness. Eur. J. Oper. Res. 165, 423-443 (2005)
3. Du, J., Leung, J.Y.-T.: Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15, 483-495 (1990)
4. Kellerer, H., Strusevich, V.A.: A Fully Polynomial Approximation Scheme for the Single Machine Weighted Total Tardiness Problem With a Common Due Date. Theoretical Computer Science 369, 230-238 (2006)
5. Kolliopoulos, S.G., Steiner, G.: Approximation Algorithms for Minimizing the Total Weighted Tardiness on a Single Machine. Theoretical Computer Science 355(3), 261-273 (2006)
6. Lawler, E.L.: A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1, 331-342 (1977)
7. Lawler, E.L.: A fully polynomial approximation scheme for the total tardiness problem. Operations Research Letters 1, 207-208 (1982)
8. Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343-362 (1977)
9. McNaughton, R.: Scheduling with due dates and loss functions. Management Sci. 6, 1-12 (1959)
10. Sen, T., Sulek, J.M., Dileepan, P.: Static scheduling research to minimize weighted and unweighted tardiness: a state-of-the-art survey. Int. J. Production Econom. 83, 1-12 (2003)
11. Yuan, J.: The NP-hardness of the single machine common due date weighted tardiness problem. Systems Sci. Math. Sci. 5, 328-333 (1992)