THE LESSONS OF FLOWSHOP SCHEDULING RESEARCH

被引：120

作者：

DUDEK, RA ^{[1
]}

PANWALKAR, SS ^{[1
]}

SMITH, ML ^{[1
]}

机构：

[1] LONESTAR,POONA,INDIA

来源：

OPERATIONS RESEARCH | 1992年 / 40卷 / 01期

关键词：

D O I：

10.1287/opre.40.1.7

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper reviews the flowshop-sequencing research since 1954 that has been devoted to the static deterministic case in which n jobs are to be processed through a shop in which the processing times at each stage are fixed. The paper then comments on NP-completeness, the selection of criteria for optimization, and the lack of applications of this work in industry. Finally, it draws some conclusions about the possible future of sequencing research and the lessons that this area's work has to teach the rest of operations research.

引用

页码：7 / 13

页数：7

共 52 条

[1] AGNETIS A, 1990, 2ND P INT C COMP INT
[2] ARORA RK, 1980, AIIE T, V12, P253
[3] AN EXPERIMENTAL INVESTIGATION AND COMPARATIVE EVALUATION OF FLOW-SHOP SCHEDULING TECHNIQUES
ASHOUR, S
[J]. OPERATIONS RESEARCH, 1970, 18 (03) : 541 - &
[4] Baker K., 1974, INTRO SEQUENCING SCH
[5] COMPARATIVE STUDY OF FLOW-SHOP ALGORITHMS
BAKER, KR
[J]. OPERATIONS RESEARCH, 1975, 23 (01) : 62 - 73
[6] SOME APPLICATIONS OF BRANCH-AND-BOUND ALGORITHM TO MACHINE SCHEDULING PROBLEM
BROWN, APG
LOMNICKI, ZA
[J]. OPERATIONAL RESEARCH QUARTERLY, 1966, 17 (02) : 173 - &
[7] Campbell H. G., 1970, MANAGE SCI, V16, P630
[8] Conway R, 1967, THEORY SCHEDULING
[9] EVALUATION OF FLOW SHOP SEQUENCING HEURISTICS
DANNENBRING, DG
[J]. MANAGEMENT SCIENCE, 1977, 23 (11) : 1174 - 1182
[10] Dantzig G.B., 1991, COMMUNICATION

← 1 2 3 4 5 6 →