WORST-CASE ANALYSIS OF AN APPROXIMATION ALGORITHM FOR FLOWSHOP SCHEDULING

被引：24

作者：

NOWICKI, E

SMUTNICKI, C

机构：

来源：

关键词：

D O I：

10.1016/0167-6377(89)90045-X

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：171 / 177

页数：7

共 7 条

[1]

CAMPBELL HG, 1970, MANAGE SCI B-APPL, V16, pB630

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

DANNENBRING, DG .

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

GONZALEZ, T ;

SAHNI, S .

[4]

Johnson S.M., 1954, NAV RES LOGIST Q, V1, P61, DOI DOI 10.1002/NAV.3800010110

NAWAZ, M ;

ENSCORE, EE ;

HAM, I .

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1983, 11 (01) :91-95

[6]

SIETIAPUTRA W, 1980, THESIS PENNSYLVANIA

[7] COMPARISON OF HEURISTICS FOR FLOWSHOP SEQUENCING [J].

TURNER, S ;

BOOTH, D .

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1987, 15 (01) :75-78