A NOTE ON EXPECTED MAKESPANS FOR LARGEST-1ST SEQUENCES OF INDEPENDENT TASKS ON 2 PROCESSORS

被引：13

作者：

COFFMAN, EG

FREDERICKSON, GN

LUEKER, GS

机构：

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

[2] UNIV CALIF IRVINE,DEPT INFORMAT & COMP SCI,IRVINE,CA 92717

来源：

关键词：

D O I：

10.1287/moor.9.2.260

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：260 / 266

页数：7

共 9 条

[1]

[Anonymous], 1969, SIAM J APPL MATH

[2] A STOCHASTIC-MODEL OF BIN-PACKING [J].

COFFMAN, EG ;

SO, K ;

HOFRI, M ;

YAO, AC .

INFORMATION AND CONTROL, 1980, 44 (02) :105-115

[3]

COFFMAN EG, 1976, REV FR AUTOMAT INFOR, V10, P17

[4]

COFFMAN EG, 1976, ACTA INFORM, V6, P1, DOI 10.1007/BF00263740

[5]

DAVID HA, 1970, ORDER STATISTICS, P17

[6]

Feller W., 1966, INTRO PROBABILITY TH, V2

[7]

Garey M. R., 1981, APPROXIMATION ALGORI, P147

[8] BOUNDS FOR CERTAIN MULTIPROCESSING ANOMALIES [J].

GRAHAM, RL .

BELL SYSTEM TECHNICAL JOURNAL, 1966, 45 (09) :1563-+

[9]

Karmarkar N., 1982, 23rd Annual Symposium on Foundations of Computer Science, P107, DOI 10.1109/SFCS.1982.37