SCHEDULING INDEPENDENT TASKS ON UNIFORM PROCESSORS

被引：54

作者：

DOBSON, G

机构：

来源：

SIAM JOURNAL ON COMPUTING | 1984年 / 13卷 / 04期

关键词：

D O I：

10.1137/0213044

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：705 / 716

页数：12

共 22 条

[1]

Coffman E.G., 1976, Computer and Job-Shop Scheduling Theory

[2]

COFFMAN EG, 1978, SIAM J COMPUT, V7, P1, DOI 10.1137/0207001

[3]

COFFMAN EG, 1977, 1977 P INT C PAR PRO

[4]

Cook S., 1971, STOC '71: Proceedings of the third annual ACM symposium on Theory of computing, P151, DOI [10.1145/800157.805047, DOI 10.1145/800157.805047]

[5]

DOBSON G, 1981, THESIS STANFORD U ST

[6] TIGHTER BOUNDS FOR THE MULTIFIT PROCESSOR SCHEDULING ALGORITHM [J].

FRIESEN, DK .

SIAM JOURNAL ON COMPUTING, 1984, 13 (01) :170-181

[7] BOUNDS FOR MULTIFIT SCHEDULING ON UNIFORM PROCESSORS [J].

FRIESEN, DK ;

LANGSTON, MA .

SIAM JOURNAL ON COMPUTING, 1983, 12 (01) :60-70

[8] PERFORMANCE GUARANTEES FOR SCHEDULING ALGORITHMS [J].

GAREY, MR ;

GRAHAM, RL ;

JOHNSON, DS .

OPERATIONS RESEARCH, 1978, 26 (01) :3-21

[9] RESOURCE CONSTRAINED SCHEDULING AS GENERALIZED BIN PACKING [J].

GAREY, MR ;

GRAHAM, RL ;

JOHNSON, DS ;

YAO, ACC .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1976, 21 (03) :257-298

[10]

Gary M. R., 1979, Computers and Intractability

← 1 2 3 →