Heuristics for scheduling in a flow shop with multiple processors

被引:114
作者
Brah, SA [1 ]
Loo, LL
机构
[1] Natl Univ Singapore, Fac Business Adm, Dept Decis Sci, Singapore 119260, Singapore
[2] Minist Educ, Singapore 248922, Singapore
关键词
scheduling; flow shop with multiple processors; flexible flow lines; simulation; heuristics;
D O I
10.1016/S0377-2217(97)00423-2
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This study investigates the performance of scheduling heuristics in a flow shop with multiple processors. We investigated five better performing flow shop heuristics for their performances of makespan and mean flow time criteria in a flow shop with multiple processors. The study examined the effects of problem characteristics (number of jobs, number of machine stages and number of parallel processors at each stage) and the performance of heuristics using regression analysis. We found that although structural characteristics explain most of the variation in performance, heuristics also had an effect. The experimental results showed that flow shop heuristics developed by Nawaz, Enscore, and Ham and that of Ho were comparable in performance in a flow shop with multiple processors. However, the former was slightly more consistent in results for both criteria. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:113 / 122
页数:10
相关论文
共 37 条
[1]  
[Anonymous], 1970, MANAGE SCI, DOI [10.1287/mnsc.16.10.b630, DOI 10.1287/MNSC.16.10.B630]
[2]  
BRAH S, 1991, J INFORMATION OPTIMI, V12, P113, DOI DOI 10.1080/02522667.1991.10699055
[3]   BRANCH AND BOUND ALGORITHM FOR THE FLOW-SHOP WITH MULTIPLE PROCESSORS [J].
BRAH, SA ;
HUNSUCKER, JL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 51 (01) :88-99
[4]   A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors [J].
Brah, SA .
PRODUCTION PLANNING & CONTROL, 1996, 7 (04) :362-373
[5]  
BRAH SA, 1992, OPTIMIZATION TECHNIQ, V1, P538
[6]  
BRAH SA, 1988, DISS ABSTR INT 1587B, V50
[7]  
BRAH SA, 1992, TIMS ORSA JOINT NAT
[8]   EVALUATION OF FLOW SHOP SEQUENCING HEURISTICS [J].
DANNENBRING, DG .
MANAGEMENT SCIENCE, 1977, 23 (11) :1174-1182
[9]   A SIMULATED ANNEALING HEURISTIC FOR SCHEDULING IN A FLOWSHOP WITH BICRITERIA [J].
GANGADHARAN, R ;
RAJENDRAN, C .
COMPUTERS & INDUSTRIAL ENGINEERING, 1994, 27 (1-4) :473-476
[10]  
GUPTA AK, 1991, INDIAN J TECHNOL, V29, P489