Scheduling identical jobs with chain precedence constraints on two uniform machines

Peter Brucker,Johann Hurink,Wieslaw Kubiak

Math. Methods Oper. Res.（1999）

引用 61|浏览0

暂无评分

摘要

. 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.

查看译文

关键词

Key words: Scheduling,uniform machines,identical jobs,chain precedence constraints

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要