On minimizing the total weighted tardiness on a single machine

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

Volumn 2996, Issue , 2004, Pages 176-186

  Kolliopoulos, Stavros G ^a   Steiner, George ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; JOB SHOP SCHEDULING;

ADDITIVE ERRORS; ARBITRARY NUMBER; PSEUDOPOLYNOMIAL ALGORITHMS; QUASI-POLY-NOMIAL; RANDOMIZED ALGORITHMS; SINGLE- MACHINES; TOTAL TARDINESS; TOTAL-WEIGHTED TARDINESS;

SCHEDULING ALGORITHMS;

EID: 33644899870     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_16     Document Type: Article

References (7)

1. R. K. Congram, G. N. Potts, and S. L. van de Velde. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 14(l):52-67, 2002.
2. J. Du and J.Y.T. Leung. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15:483-495, 1990.
3. E. L. Lawler. A "pseudopolynomial" algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, 1:331-342, 1977.
4. E. L. Lawler. A fully polynomial approximation scheme for the total tardiness problem. Operations Research Letters, 1:207-208, 1982.
5. E. L. Lawler and J. M. Moore. A functional equation and its application to resource allocation and sequencing problems. Management Science, 16:77-84, 1969.
6. J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343-362, 1977.
7. R. McNaughton. Scheduling with deadlines and loss functions. Management Science, 6:1-12, 1959.