SCHEDULING TASKS WITH NONUNIFORM DEADLINES ON 2 PROCESSORS

被引：67

作者：

GAREY, MR ^{[1
]}

JOHNSON, DS ^{[1
]}

机构：

[1] BELL TEL LABS INC,MURRAY HILL,NJ 07974

来源：

关键词：

D O I：

10.1145/321958.321967

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：461 / 467

页数：7

共 16 条

[1] Aho A. V., 1972, SIAM Journal on Computing, V1, P131, DOI 10.1137/0201008
[2] AHO AV, 1974, DESIGN ANAL COMPUTER, pCH10
[3] ARLAZAROV VL, 1970, DOKL AKAD NAUK SSSR, V11, P1209
[4] COFFMAN EG, 1972, ACTA INFORM, V1, P200, DOI DOI 10.1007/BF00288685
[5] CORRECTION
FUJII, M
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1971, 20 (01) : 141 - &
[6] OPTIMAL SEQUENCING OF 2 EQUIVALENT PROCESSORS
FUJII, M
KASAMI, T
NINOMIYA, K
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (04) : 784 - &
[7] Garey M. R., 1975, SIAM Journal on Computing, V4, P397, DOI 10.1137/0204035
[8] GRAHAM RL, 1972, P AFIPS SPRING JOINT, V40, P205
[9] Karp Richard M., 1972, COMPLEXITY COMPUTER, P85
[10] N JOB, ONE MACHINE SEQUENCING ALGORITHM FOR MINIMIZING THE NUMBER OF LATE JOBS
MOORE, JM
[J]. MANAGEMENT SCIENCE, 1968, 15 (01) : 102 - 109