Implementing global factory schedules in the face of stochastic disruptions

被引:27
作者
Barua, A
Raghavan, N
Upasani, A
Uzsoy, R
机构
[1] Purdue Univ, Sch Ind Engn, Lab Extended Enterprises Purdue, W Lafayette, IN 47907 USA
[2] Pricewaterhouse Coopers LLP, San Francisco, CA 94105 USA
[3] Valdero Inc, Palo Alto, CA 94303 USA
基金
美国国家科学基金会;
关键词
decomposition heuristics; rescheduling; global schedules; semiconductor manufacturing; dispatching; simmulation;
D O I
10.1080/00207540412331282024
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The problem of implementing global factory schedules developed from all optimization-based heuristic in a manufacturing facility with executional uncertainties in the form of machine failures is considered. A simple procedure in which jobs Lire dispatched on the shop floor is proposed based oil their start times in the global schedule is proposed. The performance of the proposed procedure relative to a number of well-known dispatching rules is evaluated using a simulation model of a scaled-down semiconductor wafer fabrication facility. Results indicate that the procedure combining the global schedule and dispatching outperforms the benchmark dispatching rules in terms of several performance measures as long as the level of variability in the system is compatible with the frequency of rescheduling.
引用
收藏
页码:793 / 818
页数:26
相关论文
共 35 条
[1]   PRIORITY UPDATE INTERVALS AND ANOMALIES IN DYNAMIC RATIO TYPE JOB SHOP SCHEDULING RULES [J].
ADAM, NR ;
SURKIS, J .
MANAGEMENT SCIENCE, 1980, 26 (12) :1227-1237
[2]   THE SHIFTING BOTTLENECK PROCEDURE FOR JOB SHOP SCHEDULING [J].
ADAMS, J ;
BALAS, E ;
ZAWACK, D .
MANAGEMENT SCIENCE, 1988, 34 (03) :391-401
[3]   Match-up scheduling under a machine breakdown [J].
Akturk, MS ;
Gorgulu, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (01) :81-97
[4]  
AYTUG H, IN PRESS EUR J OPER
[5]   THE ONE-MACHINE PROBLEM WITH DELAYED PRECEDENCE CONSTRAINTS AND ITS USE IN JOB-SHOP SCHEDULING [J].
BALAS, E ;
LENSTRA, JK ;
VAZACOPOULOS, A .
MANAGEMENT SCIENCE, 1995, 41 (01) :94-109
[6]   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
[7]  
BHASKARAN K, 1991, HDB IND ENG, pCH88
[8]   A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM [J].
BRUCKER, P ;
JURISCH, B ;
SIEVERS, B .
DISCRETE APPLIED MATHEMATICS, 1994, 49 (1-3) :107-127
[9]   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
[10]   ROBUST SCHEDULING TO HEDGE AGAINST PROCESSING TIME UNCERTAINTY IN SINGLE-STAGE PRODUCTION [J].
DANIELS, RL ;
KOUVELIS, P .
MANAGEMENT SCIENCE, 1995, 41 (02) :363-376