A SCHEDULING ALGORITHM FOR FLEXIBLE FLOW LINES WITH LIMITED INTERMEDIATE BUFFERS

被引:36
作者
Sawik, Tadeusz J. [1 ]
机构
[1] Stanislaw Staszic Univ Min & Met, Fac Mech Engn & Robot, PL-30059 Krakow, Poland
关键词
Flexible flowshop; Scheduling; Heuristic algorithm;
D O I
10.1002/asm.3150090206
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
A new heuristic algorithm is proposed for scheduling a flexible flow line with limited in-process buffers. The line is made up of a certain number of processing stages. Each stage has one or more identical parallel machines with limited buffers. Each part is processed by at most one machine in each stage. The problem objective is to minimize the makespan of the schedule for a set of part types selected for processing. The computational results for a set of test problems used in the literature are reported. In addition, the efficiency of the algorithm is tested on several groups of random problems.
引用
收藏
页码:127 / 138
页数:12
相关论文
共 8 条
[1]   EVALUATION OF FLOW SHOP SEQUENCING HEURISTICS [J].
DANNENBRING, DG .
MANAGEMENT SCIENCE, 1977, 23 (11) :1174-1182
[2]  
Johnson S.M., 1954, NAV RES LOG, V1, P61, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]
[3]  
LAWLER EL, 1989, BSR8909 CTR MATH COM
[5]  
SAWIK TJ, 1988, SYSTEM MODELLING OPT, P691
[6]   SCHEDULING ALGORITHMS FOR FLEXIBLE FLOWSHOPS - WORST AND AVERAGE CASE PERFORMANCE [J].
SRISKANDARAJAH, C ;
SETHI, SP .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 43 (02) :143-160
[7]   SCHEDULING ALGORITHMS FOR FLEXIBLE FLOW LINES [J].
WITTROCK, RJ .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1985, 29 (04) :401-412
[8]   AN ADAPTABLE SCHEDULING ALGORITHM FOR FLEXIBLE FLOW LINES [J].
WITTROCK, RJ .
OPERATIONS RESEARCH, 1988, 36 (03) :445-453