ON THE COMPLEXITY OF SCHEDULING PROBLEMS FOR PARALLEL PIPELINED MACHINES

被引：34

作者：

BERNSTEIN, D

RODEH, M

GERTNER, I

机构：

[1] TECHNION INST,DEPT ELECT ENGN,IL-32000 HAIFA,ISRAEL

[2] IBM ISRAEL LTD,ISRAEL SCI CTR,HAIFA RES GRP,DEPT SOFTWARE SYST & ALGORITHMS,IL-32000 HAIFA,ISRAEL

来源：

关键词：

D O I：

10.1109/12.29469

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：1308 / 1313

页数：6

共 17 条

[1]

BERNHEIM DB, 1987, 1987 NBER MACR ANN C, P263

[2]

BERNSTEIN D, 1986, EE PUB594 DEP EL ENG

[3]

BERNSTEIN D, 1985, 12TH P ACM S PRINC P, P325

BLAZEWICZ, J ;

LENSTRA, JK ;

KAN, AHGR .

[5]

BRUNO J, 1980, IEEE T COMPUT, V29, P308, DOI 10.1109/TC.1980.1675569

[6]

Coffman E.G., 1976, COMPUTER JOB SHOP SC

[7]

Garey M. R., 1979, GUIDE NP COMPLETENES

[8]

GOYAL DK, 1977, 6TH P TEX C COMP SYS

[9]

GRAHAM RL, 1977, DISCRETE OPTIMIZATIO

[10]

HENNESSY JL, 1983, ACM T PROGR LANG SYS, V5, P442