SCHEDULING THE OPEN SHOP TO MINIMIZE MEAN FLOW TIME

被引：41

作者：

ACHUGBUE, JO ^{[1
]}

CHIN, FY ^{[1
]}

机构：

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

来源：

关键词：

D O I：

10.1137/0211058

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：709 / 720

页数：12

共 14 条

[1]

ACHUGBUE JO, 1979, 799 U ALB DEP COMP S

[2]

ACHUGBUE JO, 1982, MATH OPER RES MAY

[3]

ACHUGBUE JO, 1980, THESIS U ALBERTA EDM

[4] ON J-MAXIMAL AND J-MINIMAL FLOWSHOP SCHEDULES [J].

CHIN, FY ;

TSAI, LL .

[5]

COFFMAN EG, 1976, COMPUTER JOBSHOP SCH

[6]

Conway R, 1967, THEORY SCHEDULING

[7]

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

[8]

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

[9] FLOW-SHOP AND JOB-SHOP SCHEDULES - COMPLEXITY AND APPROXIMATION [J].

GONZALEZ, T ;

SAHNI, S .

[10]

GONZALEZ T, 1976, 214 PENN STAT U COMP