Augmentations of consistent partial orders for the one-machine total tardiness problem

Discrete Applied Mathematics

Volumn 68, Issue 1-2, 1996, Pages 189-202

  Yu, Wenci ^a  

^a EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Consistent partial order; Dominance condition; Dominance theorem; One machine scheduling; Proper augmentation; Total tardiness problem

Indexed keywords

EID: 0012277367     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00051-R     Document Type: Article

References (4)

1. T.S. Abdul-Razaq, C.N. Potts and L.N. Van Wassenhove, A survey of algorithms for the single machine total weighted tardiness scheduling problem, Discrete Appl. Math. 2 (1990) 235-253.
2. H. Emmons, One-machine sequencing to minimize certain functions of job tardiness, Oper. Res. 17 (1969) 701-715.
3. E.L. Lawler, Recent results in the theory machine scheduling, in: A. Bachem, M. Grötschel and B. Korte, eds., Mathematical Programming: The State of Art, Bonn, 1982 (Springer, Berlin, 1983) 202-234.
4. Y. Lin, Are Emmons' conditions for the total tardiness problem consistent? Preprint, Symposium on Scheduling, Shanghai, China (1990) 1-5 (in Chinese).