A new decomposition approach for the single machine total tardiness scheduling problem

Journal of the Operational Research Society

Volumn 49, Issue 10, 1998, Pages 1101-1106

  Della Croce, F ^a   Tadei, R ^a   Baracco, P ^a   Grosso, A ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

Decomposition; Lower bound; Scheduling; Total tardiness

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROCESS CONTROL; SCHEDULING; THEOREM PROVING;

LAWLER'S DECOMPOSITION RULE; SINGLE MACHINE TOTAL TARDINESS SCHEDULING PROBLEM;

PRODUCTION CONTROL;

EID: 0032187646     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600624     Document Type: Article

References (9)

1. Du J and Leung JYT (1990). Minimizing total tardiness on one machine is NP-hard. Mathe Opns Res 15: 483-495.
2. Koulamas CP (1994). The total tardiness problem: review and extensions. Opns Res 42: 1025-1041.
3. Emmons H (1969). One-machine sequencing to minimize certain functions of job tardiness. Opns Res 17: 701-715.
4. Lawler EL (1977). A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals Discrete Mathe 1: 331-342.
5. Potts CN and Van Wassenhove LN (1982). A decomposition algorithm for the single machine total tardiness problem. Opns Res Letters 5: 177-181.
6. 2 Management and Management Science Series-Quorum Books 5, London, pp. 407-419.
7. Szwarc W and Mukhopadhyay S (1996). Decomposition of the single machine total tardiness problem. Opns Res Letters 19: 243-250.
8. Chu C (1992). A branch and bound algorithm to minimize total tardiness with different release times. Naval Res Logist 39: 265-283.
9. Panwalkar SS, Smith ML and Koulamas CP (1993). A heuristic for the single machine tardiness problem. Eur J Opl Res 70: 304-310.