ON THE MULTIPLE-MACHINE EXTENSION TO A COMMON DUE-DATE ASSIGNMENT AND SCHEDULING PROBLEM

被引:4
|
作者
DE, P [1 ]
GHOSH, JB [1 ]
WELLS, CE [1 ]
机构
[1] UNIV DAYTON,DEPT MIS & DESIGN SCI,300 COLL PK,DAYTON,OH 45469
关键词
DUE-DATE ASSIGNMENT; SCHEDULING; SEQUENCING;
D O I
10.2307/2583755
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In 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.
引用
收藏
页码:419 / 422
页数:4
相关论文
共 50 条