A NOTE ON OPTIMAL ASSIGNMENT OF SLACK DUE-DATES IN SINGLE-MACHINE SCHEDULING

被引：20
|
作者：
GORDON, VS
机构：
[1] Belarus Acad of Sciences, Minsk, Belarus
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1993年 / 70卷 / 03期
关键词：
SCHEDULING; DUE-DATE ASSIGNMENT; SINGLE MACHINE;
D O I：
10.1016/0377-2217(93)90242-F
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper extends T.C.E. Cheng's approach for optimal assignment of slack due-dates and sequencing in the single-machine shop to the case when preemption is allowed and there are precedence constraints and ready times of jobs. It is shown that under special conditions the presented algorithm may be used when preemption is not allowed.
引用
收藏
页码：311 / 315
页数：5
相关论文
共 50 条
12345