×

Dynamic state-dependent dispatching for wafer fabrication. (English) Zbl 1060.90543

Summary: A Dynamic State-Dependent Dispatching (DSDD) heuristic for a wafer fabrication plant is presented. The DSDD heuristic dynamically uses different dispatching rules according to the state of a production system. Rather than developing new rules, the DSDD heuristic combines and modifies existing rules. This heuristic first classifies workstations into dynamic bottlenecks and non-dynamic bottlenecks. Dynamic bottleneck workstations apply a revised two-boundary dispatching rule when their queue length exceeds the average obtained from simulation using constant lot-release policy and first-in, first-out dispatching rule. Otherwise, the shortest expected processing time until next visit dispatching rule is used. A revised FGCA (FGCA+) dispatching rule is used for all non-dynamic bottlenecks workstations. Simulation results demonstrate that the DSDD heuristic obtains the best performance among the compared six dispatching rules in terms of average and standard deviation of cycle time and work-in-process.

MSC:

90B30 Production models
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Chung SH, Journal of the Chinese Institute of Industrial Engineers 16 pp 93– (1999)
[2] DOI: 10.1109/66.4371 · doi:10.1109/66.4371
[3] DOI: 10.1109/66.492820 · doi:10.1109/66.492820
[4] DOI: 10.1109/66.661295 · doi:10.1109/66.661295
[5] Lee KJ, Department of Industrial Engineering, National Chiao Tung University (1995)
[6] Levitt ME Abraham JA 1990 Just-In-Time methods for semiconductor manufacturing In IEEE/SEMI Advanced Semiconductor Manufacturing Conference pp. 3–9
[7] DOI: 10.1109/66.484296 · doi:10.1109/66.484296
[8] DOI: 10.1016/S0377-2217(99)00446-4 · Zbl 0979.90026 · doi:10.1016/S0377-2217(99)00446-4
[9] DOI: 10.1109/66.44620 · doi:10.1109/66.44620
[10] DOI: 10.1109/66.311341 · doi:10.1109/66.311341
[11] Montgomery DC, Design and Analysis of Experiments (2001)
[12] Morito S, Proceedings of the 1997 Winter Simulation Conference pp pp. 872–879– (1997)
[13] DOI: 10.1109/66.778190 · doi:10.1109/66.778190
[14] O’Neil P 1991 Performance evaluation of lot dispatching and scheduling algorithms through discrete event simulation In 1991 IEEE/SEMI International Semiconductor Manufacturing Science Symposium pp. 21–24
[15] DOI: 10.1111/j.1540-5915.2000.tb01629.x · doi:10.1111/j.1540-5915.2000.tb01629.x
[16] DOI: 10.1109/66.4384 · doi:10.1109/66.4384
[17] DOI: 10.1109/66.492825 · doi:10.1109/66.492825
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.