COMPLEXITY AND SOLUTIONS OF SOME 3-STAGE FLOWSHOP SCHEDULING PROBLEMS

被引：9

作者：

ACHUGBUE, JO ^{[1
]}

CHIN, FY ^{[1
]}

机构：

[1] UNIV ALBERTA,DEPT COMP SCI,EDMONTON T6G 2H1,ALBERTA,CANADA

来源：

关键词：

D O I：

10.1287/moor.7.4.532

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：532 / 544

页数：13

共 13 条

[1] ACHUGBUE JO, 1980, THESIS U ALBERTA EDM
[2] NOTE ON A PAPER BY SZWARC,W
ARTHANARY, TS
MUKHOPAD.AC
[J]. NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (01): : 135 - +
[3] JOHNSONS 3-MACHINE FLOW-SHOP CONJECTURE
BURNS, F
ROOKER, J
[J]. OPERATIONS RESEARCH, 1976, 24 (03) : 578 - 580
[4] 3-STAGE FLOW-SHOPS WITH RECESSIVE SECOND STAGE
BURNS, F
ROOKER, J
[J]. OPERATIONS RESEARCH, 1978, 26 (01) : 207 - 208
[5] SPECIAL CASE OF 3XN FLOW SHOP PROBLEM
BURNS, F
ROOKER, J
[J]. NAVAL RESEARCH LOGISTICS, 1975, 22 (04) : 811 - 817
[6] CHIN FY, J ASS COMPUT MACH, V28, P462
[7] COFFMAN EG, 1976, COMPUTER JOB SHOP SC, P26
[8] Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117
[9] STRONG NP-COMPLETENESS RESULTS - MOTIVATION, EXAMPLES, AND IMPLICATIONS
GAREY, MR
JOHNSON, DS
[J]. JOURNAL OF THE ACM, 1978, 25 (03) : 499 - 508
[10] FLOW-SHOP AND JOB-SHOP SCHEDULES - COMPLEXITY AND APPROXIMATION
GONZALEZ, T
SAHNI, S
[J]. OPERATIONS RESEARCH, 1978, 26 (01) : 36 - 52