SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME

被引：322

作者：

BRUNO, J ^{[1
]}

COFFMAN, EG ^{[1
]}

SETHI, R ^{[1
]}

机构：

[1] PENN STATE UNIV,DEPT COMP SCI,UNIVERSITY PK,PA 16802

来源：

关键词：

D O I：

10.1145/361011.361064

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：382 / 387

页数：6

共 10 条

[1] [Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047
[2] BRUNO JA, 1973, 141 PENN STAT U COMP
[3] COFFMAN EG, 1973, 140 PENN STAT U COMP
[4] CONWAY RW, 1900, THEORY SCHEDULING
[5] Ford Lester R., 1962, FLOWS NETWORKS
[6] BOUNDS ON MULTIPROCESSING TIMING ANOMALIES
GRAHAM, RL
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (02) : 416 - &
[7] GRAHAM RL, 1966, BELL SYST TECH J NOV, P1563
[8] Karp R. M., 1972, COMPLEXITY COMPUTER
[9] SAHNI S, 1972, 13TH P IEEE S SWITCH, P130
[10] ULLMAN JD, 1973, TR9 U CAL BERK DEP C