Some remarks on the decomposition properties of the single machine total tardiness problem

European Journal of Operational Research

Volumn 177, Issue 1, 2007, Pages 623-625

  Szwarc, Wlodzimierz ^a  

^a UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

Author keywords

Decomposition; Due dates; Tardiness

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; INDUSTRIAL MANAGEMENT; PROBLEM SOLVING; THEOREM PROVING;

DECOMPOSITION THEOREMS; DUE DATES; PSEUDOPOLYNOMIAL ALGORITHMS; TARDINESS;

OPERATIONS RESEARCH;

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

References (7)

1. Chang S., Lu Q., Tang G., and Yu W. On decomposition of the total tardiness problem. Operations Research Letters 17 (1995) 221-229
2. Emmons H. One machine sequencing to minimize certain functions of job tardiness. Operations Research 17 (1969) 701-715
3. Lawler E.L. A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1 (1977) 331-342
4. Potts V.N., and Van Wassenhove L.N. A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters 1 (1982) 177-181
5. Szwarc W. Single machine total tardiness problem revisited. In: Ijiri Y. (Ed). Creative and Innovative Approaches to the Science of Management (1993), Quorum Books 407-419
6. Szwarc W., Della Croce F., and Grosso A. Solution of the single-machine total tardiness problem. Journal of Scheduling 2 (1999) 55-71
7. Szwarc W., Grosso A., and Della Croce F. Algorithmic paradoxes of the single-machine total tardiness problem. Journal of Scheduling 4 (2001) 93-104