On the single machine total tardiness problem

European Journal of Operational Research

Volumn 165, Issue 3, 2005, Pages 843-846

  Tian, Z J ^a   Ng, C T ^a   Cheng, T C E ^a  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Scheduling; Single machine; Total tardiness

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; JOB ANALYSIS; OPERATIONS RESEARCH; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

BRANCH-AND-BOUND METHOD; EVEN-ODD PARTITION PROBLEM; SINGLE MACHINE; TOTAL TARDINESS;

SCHEDULING;

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

References (11)

1. Chen B., Potts C., Woeginger G. A review of machine scheduling: Complexity, algorithms and approximability. Handbook of Combinatorial Optimization. 1998;Kluwer Academic Publishers, Boston. pp. 21-169
2. Du J.Z., Leung J.Y.-T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research. 15:1990;483-495
3. Emmons H. One-machine sequencing to minimize certain functions of job tardiness. Operations Research. 17:1969;701-715
4. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Operations Research. 5:1979;287-326
5. Koulamas C. The total tardiness problem: Review and extensions. Operations Research. 42:1994;1025-1041
6. Koulamas C. Polynomially solvable total tardiness problems: Review and extensions. Omega. 25:1997;235-239
7. Lawler E.L. A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics. 1:1977;31-342
8. Lawler E.L., Moore J.M. A functional equation and its application to resource allocation and sequencing problems. Management Science. 16:1969;77-84
9. Szwarc W., Della Croce F., Grosso A. Solution of the single machine total tardiness problem. Journal of Scheduling. 2:1999;55-71
10. Szwarc W., Grosso A., Della Croce F. Algorithmic paradoxes of the single-machine total tardiness problem. Journal of Scheduling. 4:2001;93-104
11. Z.J. Tian, C.T. Ng, T.C.E. Cheng, Preemptive scheduling with agreeable release dates and due dates to minimize total tardiness, Proceedings of the 5th International Conference on Optimization Techniques and Applications, Hong Kong, 2001, pp. 405-412