Scheduling identical jobs with chain precedence constraints on two uniform machines

被引：0
|
作者：
Brucker, P [1 ]
Hurink, J
Kubiak, W
机构：
[1] Univ Osnabruck, Fachbereich Math Informat, D-49069 Osnabruck, Germany
[2] Univ Twente, Fac Math Sci, NL-7500 AE Enschede, Netherlands
[3] Mem Univ Newfoundland, Fac Business Adm, St Johns, NF, Canada
来源：
MATHEMATICAL METHODS OF OPERATIONS RESEARCH | 1999年 / 49卷 / 02期
关键词：
scheduling; uniform machines; identical jobs; chain precedence constraints;
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The problem of scheduling identical jobs with chain precedence constraints on two uniform machines is considered. It is shown that the corresponding makespan problem can be solved in linear time.
引用
收藏
页码：211 / 219
页数：9
相关论文
共 50 条
12345