COMPLEXITY RESULTS FOR SCHEDULING TASKS IN FIXED-INTERVALS ON 2 TYPES OF MACHINES

被引：9

作者：

NAKAJIMA, K

HAKIMI, SL

LENSTRA, JK

机构：

[1] NORTHWESTERN UNIV,DEPT ELECT ENGN & COMP SCI,EVANSTON,IL 60201

[2] MATH CENTRUM,1098 SJ AMSTERDAM,NETHERLANDS

来源：

关键词：

D O I：

10.1137/0211040

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：512 / 520

页数：9

共 17 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

Dantzig G.B., 1954, NAV RES LOGIST Q, V1, P217, DOI 10.1002/(ISSN)1931-919310.1002/nav.v1:310.1002/nav.3800010309

[3]

Ford L. R., 1962, FLOWS NETWORKS

[4]

Garey Michael R., 1979, COMPUTERS INTRACTABI

GAREY, MR ;

JOHNSON, DS .

[6] MINIMAL RESOURCES FOR FIXED AND VARIABLE JOB SCHEDULES [J].

GERTSBAKH, I ;

STERN, HI .

[7]

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

[8]

GUPTA UI, 1979, IEEE T COMPUT, V28, P807, DOI 10.1109/TC.1979.1675260

[9]

HASHIMOTO A, 1971, 8TH P DES AUT WORKSH, P155

[10]

HASHIMOTO A, 1970, ILLIAC 4