Match-up scheduling under a machine breakdown

被引:97
作者
Akturk, MS [1 ]
Gorgulu, E [1 ]
机构
[1] Bilkent Univ, Fac Engn, Dept Ind Engn, TR-06533 Ankara, Turkey
关键词
scheduling; heuristics; branch and bound;
D O I
10.1016/S0377-2217(97)00396-2
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
When a machine breakdown forces a modified flow shop (MFS) out of the prescribed state, the proposed strategy reschedules part of the initial schedule to match up with the preschedule at some point. The objective is to create a new schedule that is consistent with the other production planning decisions like material flow, tooling and purchasing by utilizing the time critical decision making concept. We propose a new rescheduling strategy and a match-up point determination procedure through a feedback mechanism to increase both the schedule quality and stability. The proposed approach is compared with alternative reactive scheduling methods under different experimental settings. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:81 / 97
页数:17
相关论文
共 23 条
[1]  
ADIRI I, 1989, ACTA INFORM, V26, P676
[2]   Part-machine grouping using a multi-objective cluster analysis [J].
Akturk, MS ;
Balkose, HO .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (08) :2299-2315
[3]   MATCHUP SCHEDULING WITH MULTIPLE RESOURCES, RELEASE DATES AND DISRUPTIONS [J].
BEAN, JC ;
BIRGE, JR ;
MITTENTHAL, J ;
NOON, CE .
OPERATIONS RESEARCH, 1991, 39 (03) :470-483
[4]  
Blazewicz J., 1993, SCHEDULING COMPUTER
[5]  
CHU CB, 1992, NAV RES LOG, V39, P265, DOI 10.1002/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO
[6]  
2-L
[7]  
Davis W. J., 1988, International Journal of Computer Integrated Manufacturing, V1, P101, DOI 10.1080/09511928808944350
[8]  
DU J, 1988, MINIMIZING MEAN FLOW
[9]   MINIMIZING TOTAL TARDINESS ON ONE MACHINE IS NP-HARD [J].
DU, JZ ;
LEUNG, JYT .
MATHEMATICS OF OPERATIONS RESEARCH, 1990, 15 (03) :483-495
[10]   A REVIEW OF PRODUCTION SCHEDULING [J].
GRAVES, SC .
OPERATIONS RESEARCH, 1981, 29 (04) :646-675