Polynomially solvable total tardiness problems: Review and extensions

Omega

Volumn 25, Issue 2, 1997, Pages 235-239

  Koulamas, C ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

Parallel machines; Polynomial solutions; Scheduling; Single machine; Tardiness

Indexed keywords

PROBLEM SOLVING; SCHEDULING ALGORITHMS;

PARALLEL MACHINE; POLYNOMIAL SOLUTION; POLYNOMIALLY SOLVABLE; SCHEDULING; SINGLE MACHINE TOTAL TARDINESS PROBLEM; SINGLE- MACHINES; SOLVABLE CASE; TARDINESS; TOTAL TARDINESS;

POLYNOMIALS;

EID: 0031115734     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0483(96)00064-3     Document Type: Article

References (7)

1. 1. Emmons, H., One-machine sequencing to minimize certain functions of job tardiness. Operations Research, 1969, 17, 701-715.
2. 2. Lawler, E. L., A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, 1977, 1, 331-342.
3. 3. Koulamas, C. P., The total tardiness problem: review and extensions. Operations Research, 1994, 42, 1025-1041.
4. 4. Du, J. and Leung, J. Y. T., Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 1990, 15, 483-495.
5. 5. Potts, C. N. and Van Wassenhove, L. N., A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters, 1982, 1, 177-181.
6. 6. Conway, R. W., Maxwell, W. L. and Miller, L. W., Theory of Scheduling. Addison Wesley, Reading, MA, 1967.
7. 7. Chu, C., A branch-and-bound algorithm to minimize total tardiness with different release dates. Naval Research Logistics, 1992, 39, 265-283.