SCHEDULING ALGORITHMS FOR FLEXIBLE FLOWSHOPS - WORST AND AVERAGE CASE PERFORMANCE

被引：109

作者：

SRISKANDARAJAH, C ^{[1
]}

SETHI, SP ^{[1
]}

机构：

[1] UNIV TORONTO,FAC MANAGEMENT,TORONTO M5S 1V4,ONTARIO,CANADA

来源：

关键词：

D O I：

10.1016/0377-2217(89)90208-7

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：143 / 160

页数：18

共 25 条

[1]

ARTHANARI TS, 1974, THESIS INDIAN STATIS

[2]

COFFMAN EG, 1978, SIAM J COMPUT, V7, P1, DOI 10.1137/0207001

[3] EVALUATION OF FLOW SHOP SEQUENCING HEURISTICS [J].

DANNENBRING, DG .

[4] TIGHTER BOUNDS FOR THE MULTIFIT PROCESSOR SCHEDULING ALGORITHM [J].

FRIESEN, DK .

[5] EVALUATION OF A MULTIFIT-BASED SCHEDULING ALGORITHM [J].

FRIESEN, DK ;

LANGSTON, MA .

[6]

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

[7]

Garey MR., 1979, COMPUTERS INTRACTABI

[8]

Gilmore P.C., 1964, OPER RES, V12, P665

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

GONZALEZ, T ;

SAHNI, S .

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

GRAHAM, RL .