EXACT AND APPROXIMATE ALGORITHMS FOR SCHEDULING NONIDENTICAL PROCESSORS

被引：282

作者：

HOROWITZ, E

SAHNI, S

机构：

[1] UNIV SO CALIF, PROGRAM COMP SCI, LOS ANGELES, CA 90007 USA

[2] UNIV MINNESOTA, DEPT COMP INFORMATION & CONTROL SCI, MINNEAPOLIS, MN 55455 USA

来源：

JOURNAL OF THE ACM | 1976年 / 23卷 / 02期

关键词：

D O I：

10.1145/321941.321951

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：317 / 327

页数：11

共 15 条

[1] SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J].

BRUNO, J ;

COFFMAN, EG ;

SETHI, R .

COMMUNICATIONS OF THE ACM, 1974, 17 (07) :382-387

[2]

BRUNO J, 1974, ALGORITHMS MINIMIZIN, P504

[3]

COFFMAN EG, 1974, ALGORITHMS MINIMIZIN

[4]

Conway R, 1967, THEORY SCHEDULING

[5] BOUNDS ON MULTIPROCESSING TIMING ANOMALIES [J].

GRAHAM, RL .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (02) :416-&

[6] COMPUTING PARTITIONS WITH APPLICATIONS TO KNAPSACK PROBLEM [J].

HOROWITZ, E ;

SAHNI, S .

JOURNAL OF THE ACM, 1974, 21 (02) :277-292

[7]

IBARRA OH, 1974, 7413 U MINN COMP SCI

[8]

Karp Richard M., 1972, COMPLEXITY COMPUTER, P85

[9]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[10] CHARACTERIZATION AND THEORETICAL COMPARISON OF BRANCH-AND-BOUND ALGORITHMS FOR PERMUTATION PROBLEMS [J].

KOHLER, WH ;

STEIGLIT.K .

JOURNAL OF THE ACM, 1974, 21 (01) :140-156

← 1 2 →