Abstract
Queueing networks arising from multistage processes with probabilistic re-entrant lines are common in manufacturing environments. Probabilistic re-entrant flow is defined as lots entering the operation with different repeated cycle requirements. This paper presents a computational model based on the mean value analysis (MVA) technique considering a probabilistic re-entrant operation with yield probabilities for a Power Soak operation. The objective of this work is to develop a solution method to determine the total cycle time and the mean throughput for a Power Soak operation in a semiconductor back end industry. In addition, a method based on the saturation of the mean throughput, is developed to determine the maximum number of lots and the target cycle time for the operation. Using analytical and simulation methods, comparison results are made under various probabilistic re-entrant and yield conditions. Results show that the analytical model developed has close agreement with the simulation results. The method proposed can be used by operations managers to determine their lots' cycle times and the maximum number of lots and eventually tie to the performance of the operation.
Recommended Citation
Kumar, Suresh
(2011),
MEAN VALUE ANALYSIS WITH COMBINATIONAL ROUTING AND YIELD PROBABILITIES FOR A POWER SOAK RE-ENTRANT OPERATION,
Yanbu Journal of Engineering and Science: Vol. 2:
Iss.
1, 1-13.
DOI: https://doi.org/10.53370/001c.23742
Available at:
https://yjes.researchcommons.org/yjes/vol2/iss1/1
