Algorithmic paradoxes of the single-machine total tardiness problem

Journal of Scheduling

Volumn 4, Issue 2, 2001, Pages 93-104

  Szware, Wlodzimierz ^a,c   Grosso, Andrea ^d   Croce, Federico Delia ^b  

^a UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

^b POLITECNICO DI TORINO   (Italy)

^c Unit 33   (United States)

^d NONE

Author keywords

Decomposition; Due dates; Lower bound; Single machine scheduling; Tardiness

Indexed keywords

EID: 0001957735     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.69     Document Type: Article

References (7)

1. Szwarc W, Delia Croce F, Grosso A. Solution of the single-machine total tardiness problem. Journal of Scheduling 1999; 2:55-71.
2. Potts CN, Van Wassenhove LN. A decomposition algorithm for the single-machine total tardiness problem. Operations Research Letters 1982; 26:177-182.
3. Chang S, Lu Q, Tang G, Yu W. On decomposition of the total tardiness problem. Operations Research Letters 1995; 17:221-229.
4. Emmons H. One machine sequencing to minimize certain functions of job tardiness. Operations Research 1969; 17:710-715.
5. Lawler EL. A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1977; 1:331-342.
6. Della Croce F, Tadei R, Baracco P, Grosso A. A new decomposition approach for the single machine total tardiness problem. Journal of Operational Research Society 1998; 49:1101-1106.
7. Szwarc W. Single machine total tardiness problem revisited. In Creative and Innovative Approaches to Science of Management, Ijiri Y (ed.). Quorum Books, Westport, CT, 1993; 407-419.