On the Multiple-machine Extension to a Common Due-date Assignment and Scheduling Problem
作者:
DePrabuddha,
GhoshJay B.,
WellsCharles E.,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1991)
卷期:
Volume 42,
issue 5
页码: 419-422
ISSN:0160-5682
年代: 1991
DOI:10.1057/jors.1991.84
出版商: Taylor&Francis
关键词: due-date assignment;scheduling;sequencing
数据来源: Taylor
摘要:
AbstractIn a recent paper, Cheng considers the multiple-machine extension to a due-date assignment and scheduling problem. He implicitly assumes zero start times for all schedules (which does not ensure optimality), and overlooks the critical V-shape property for an optimal schedule (which leads him to over-estimate the effort needed to solve the problem). In this note, we correct these flaws, and also discuss the complexity of the problem and its special cases.
点击下载:
PDF (1969KB)
返 回