Scheduling with precedence constraints:: Mixed graph coloring in series-parallel graphs

被引：0
|
作者：
Furmanczyk, Hanna [1 ]
Kosowski, Adrian [2 ]
Zylinski, Pawel [1 ,2 ]
机构：
[1] Univ Gdansk, Inst Comp Sci, PL-80952 Gdansk, Poland
[2] Gdarisk Univ Technol, Dept Algorithams & Syst Modelling, Gdansk, Poland
来源：
PARALLEL PROCESSING AND APPLIED MATHEMATICS | 2008年 / 4967卷
关键词：
SUBJECT;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We consider the mixed graph coloring problem which is used for formulating scheduling problems where both incompatibility and precedence constraints can be present. We give an O(n(3.376) log n) algorithm for finding an optimal schedule for a collection of jobs whose constraint relations form a mixed series-parallel graph.
引用
收藏
页码：1001 / +
页数：2
相关论文
共 50 条
12345