Parallel-machine rescheduling with machine disruptions

被引:26
作者
Azizoglu, M [1 ]
Alagöz, O
机构
[1] Middle E Tech Univ, Dept Ind Engn, TR-06531 Ankara, Turkey
[2] Univ Pittsburgh, Dept Ind Engn, Pittsburgh, PA 15261 USA
关键词
D O I
10.1080/07408170500288133
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this study we consider a rescheduling problem on identical parallel machines. The rescheduling is undertaken because of a period of unavailability on one of the machines. We consider the total flow time as an efficiency measure and stability is gauged in terms of the number of jobs processed on different machines in the original and new schedules. We show that all efficient schedules with respect to efficiency and stability measures can be generated in polynomial time.
引用
收藏
页码:1113 / 1118
页数:6
相关论文
共 14 条
[1]   Match-up scheduling under a machine breakdown [J].
Akturk, MS ;
Gorgulu, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (01) :81-97
[2]   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
[3]   ANALYSIS OF PERIODIC AND EVENT-DRIVEN RESCHEDULING POLICIES IN DYNAMIC SHOPS [J].
CHURCH, LK ;
UZSOY, R .
INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 1992, 5 (03) :153-163
[4]  
CONWAY RW, 1967, THEOYR SCHEDULING
[5]   Rescheduling and optimization of schedules considering machine failures [J].
Guo, B ;
Nonaka, Y .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1999, 60-1 :503-513
[6]  
KASPI M, 1988, SCHEDULIGN IDENTICAL
[7]  
LAWLER EL, 1989, BSR8909 CTR MATH COM
[8]  
LEON VJ, 1992, NAV RES LOG, V39, P53, DOI 10.1002/1520-6750(199202)39:1<53::AID-NAV3220390105>3.0.CO
[9]  
2-C
[10]  
LI E, 1996, COMPUT IND ENG, V31, P213