Article
Optimal Common Due-date with Limited Completion Time
Computers and Operations Research
(1991)
Abstract
T.C.E. Cheng [Computers Ops Res. 15, 91–96 (1988)] recently presented an interesting variation of the common due-date scheduling problem. He considered the situation where jobs that only marginally miss the common due-date are not penalized. His major conclusion, as given in Lemma 1, is a sufficient but not necessary requirement for optimality. We prove that alternate optima exist.
Disciplines
Publication Date
1991
DOI
10.1016/0305-0548(91)90048-V
Citation Information
Bernard Dickman, Yonah Wilamowsky and Sheldon Epstein. "Optimal Common Due-date with Limited Completion Time" Computers and Operations Research Vol. 18 Iss. 1 (1991) p. 125 - 127 ISSN: 0305-0548 Available at: http://works.bepress.com/yonah-wilamowsky/4/