Quick optimal algorithm for sequencing on one machine to minimize total tardiness

International Journal of Production Economics

Volumn 60, Issue , 1999, Pages 549-555

  Hirakawa, Yasuhiro ^a  

^a TOKYO UNIVERSITY OF SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; JOB ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

BRANCH AND BOUND METHOD; LAWLER DECOMPOSITION THEOREM; TOTAL TARDINESS;

SCHEDULING;

EID: 0032648215     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(98)00197-2     Document Type: Article

References (5)

1. J. Du, J.Y.-T. Leung, Minimizing total tardiness on one processor is NP-hard, Mathematics of Operations Research 3 (1990) 483-495.
2. E.L. Lawler, A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness, Annals of Discrete Mathematics 1 (1977) 331-342.
3. P. Brucker, Scheduling Algorithms, Springer, Berlin, 1995, pp. 93-97.
4. C.N. Potts, L.N. van Wassenhove, Single machine tardiness sequencing heuristics, HE Transactions 23 (4) (1991) 346-354.
5. J.E. Holsenback, R.M. Russell, A heuristic algorithm for sequencing on one machine to minimize total tardiness, Journal of the Operational Research Society 43 (1) (1992) 53-62.