FLOW-SHOP AND JOB-SHOP SCHEDULES - COMPLEXITY AND APPROXIMATION

被引：295

作者：

GONZALEZ, T

SAHNI, S

机构：

来源：

关键词：

D O I：

10.1287/opre.26.1.36

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：36 / 52

页数：17

共 10 条

[1]

BRUCKER P, 1975, BW4375 MATH CENTR TE

[2]

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

[3]

Conway R, 1967, THEORY SCHEDULING

[4]

Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117

[5]

Gonzalez T., 1977, SIAM Journal on Computing, V6, P155, DOI 10.1137/0206013

[6]

GONZALEZ T, 1976, J ACM, V23, P665, DOI 10.1145/321978.321985

[7] BOUNDS ON MULTIPROCESSING TIMING ANOMALIES [J].

GRAHAM, RL .

[8]

Jackson J.R., 1956, NAV RES LOGIST Q, V3, P201, DOI [10.1002/nav.3800030307, DOI 10.1002/NAV.3800030307]

[9]

Karp Richard M., 1972, COMPLEXITY COMPUTER, P85

[10]

Sahni S., 1974, SIAM Journal on Computing, V3, P262, DOI 10.1137/0203021