COMPLEXITY OF SCHEDULING UNDER PRECEDENCE CONSTRAINTS

被引：311

作者：

LENSTRA, JK ^{[1
]}

RINNOOYKAN, AHG ^{[1
]}

机构：

[1] ERASMUS UNIV, ROTTERDAM, NETHERLANDS

来源：

关键词：

D O I：

10.1287/opre.26.1.22

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：22 / 35

页数：14

共 34 条

[1] OPTIMAL LINEAR ORDERING [J].

ADOLPHSON, D ;

HU, TC .

[2]

Adolphson D. L., 1977, SIAM Journal on Computing, V6, P40, DOI 10.1137/0206002

[3]

[Anonymous], 1973, DISCRETE MATH

[4]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[5]

Bricker P., 1977, ANN DISCRETE MATH, V1, P343, DOI [DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]

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

BRUNO, J ;

COFFMAN, EG ;

SETHI, R .

[7]

BRUNO J, 1975, COMPLEXITY MEAN FLOW

[8]

COFFMAN EG, 1972, ACTA INFORM, V1, P200, DOI DOI 10.1007/BF00288685

[9]

Conway R, 1967, THEORY SCHEDULING

[10]

Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1