Implementing global factory schedules in the face of stochastic disruptions

Abstract

The problem of implementing global factory schedules developed from an optimization-based heuristic in a manufacturing facility with executional uncertainties in the form of machine failures is considered. A simple procedure in which jobs are dispatched on the shop floor is proposed based on 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.

Keywords:

• Decomposition heuristics
• Rescheduling
• Global schedules
• Semi-conductor manufacturing
• Dispatching
• Simulation

Acknowledgements

Research was supported by NSF Grant DMI-9613708 and by Intel Corporation, as well as by a software grant from Symix Systems. R.U. dedicates the paper to the memory of the late Professor A. Alan B. Pritsker, whose interest in this work in its early stages was stimulating and encouraging.