COMPLEXITY RESULTS FOR SCHEDULING CHAINS ON A SINGLE-MACHINE

被引：44

作者：

LENSTRA, JK ^{[1
]}

RINNOOYKAN, AHG ^{[1
]}

机构：

[1] ERASMUS UNIV,ROTTERDAM,NETHERLANDS

来源：

关键词：

D O I：

10.1016/0377-2217(80)90111-3

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：270 / 275

页数：6

共 18 条

[1]

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

[2]

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

[3]

Conway R, 1967, THEORY SCHEDULING

[4]

Garey M.R., 1979, COMPUTERS INTRACTABI

[5] SCHEDULING TASKS WITH NONUNIFORM DEADLINES ON 2 PROCESSORS [J].

GAREY, MR ;

JOHNSON, DS .

GAREY, MR ;

JOHNSON, DS .

[7]

GAREY MR, 1975, COMMUNICATION

[8]

Graham R. L., 1979, Discrete Optimisation, P287

[9]

Ibaraki T., 1976, Transactions of the Institute of Electronics and Communication Engineers of Japan, Section E (English), VE59, P1

[10]

LAGEWEG BJ, 1976, COMMUNICATION