낮은 교통밀도 하에서 서버 고장을 고려한 복수 서버 대기행렬 모형의 체제시간에 대한 분석
On the Exact Cycle Time of Failure Prone Multiserver Queueing Model Operating in Low Loading
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this paper, we present a new way to derive the mean cycle time of the G/G/m failure prone queue when the loading of the system approaches to zero. The loading is the relative ratio of the arrival rate to the service rate multiplied by the number of servers. The system with low loading means the busy fraction of the system is low. The queueing system with low loading can be found in the semiconductor manufacturing process. Cluster tools in semiconductor manufacturing need a setup whenever the types of two successive lots are different. To setup a cluster tool, all wafers of preceding lot should be removed. Then, the waiting time of the next lot is zero excluding the setup time. This kind of situation can be regarded as the system with low loading. By employing absorbing Markov chain model and renewal theory, we propose a new way to derive the exact mean cycle time. In addition, using the proposed method, we present the cycle times of other types of queueing systems. For a queueing model with phase type service time distribution, we can obtain a two dimensional Markov chain model, which leads us to calculate the exact cycle time. The results also can be applied to a queueing model with batch arrivals. Our results can be employed to test the accuracy of existing or newly developed approximation methods. Furthermore, we provide intuitive interpretations to the results regarding the expected waiting time. The intuitive interpretations can be used to understand logically the characteristics of systems with low loading.
Abstract
In this paper, we present a new way to derive the mean cycle time of the G/G/m failure prone queue when the loading of the system approaches to zero. The loading is the relative ratio of the arrival rate to the service rate multiplied by the number of servers. The system with low loading means the busy fraction of the system is low. The queueing system with low loading can be found in the semiconductor manufacturing process. Cluster tools in semiconductor manufacturing need a setup whenever the types of two successive lots are different. To setup a cluster tool, all wafers of preceding lot should be removed. Then, the waiting time of the next lot is zero excluding the setup time. This kind of situation can be regarded as the system with low loading. By employing absorbing Markov chain model and renewal theory, we propose a new way to derive the exact mean cycle time. In addition, using the proposed method, we present the cycle times of other types of queueing systems. For a queueing model with phase type service time distribution, we can obtain a two dimensional Markov chain model, which leads us to calculate the exact cycle time. The results also can be applied to a queueing model with batch arrivals. Our results can be employed to test the accuracy of existing or newly developed approximation methods. Furthermore, we provide intuitive interpretations to the results regarding the expected waiting time. The intuitive interpretations can be used to understand logically the characteristics of systems with low loading.
참고문헌 (14)
- Avi-Itzhak, B., "A Sequence of Service Stations with Arbitrary Input and Regular Service Times", Management Science, 11(5), pp.565~571 (1965)
- Avi-Itzhak, B., "Some Queueing Problems with the Service Station Subject to Breakdown", Operations Research, 11(3), pp.303~320 (1963)
- Gaver, D. P., "A Waiting Line with Interrupted Service, including Priorities", Journal of the Royal Statistical Society : Series B, 24(1), pp.73~90 (1962)
- Hopp, W.J., "Factory Physics : Foundations of Manufacturing Management" (2001), Mc-Graw-Hill
- Kim, C. -O., "A Single Server Queue Operating under N-Policy with a Renewal Break down Process", Journal of the Society of Korea Industrial and Systems Engineering, 19(39), pp.205~218 (1996)
- 김원경, "시뮬레이션에 의한 이중 종단 대기행렬 모델의 설계 및 평가", 대한설비관리학회지, 17(3), pp.13~23 (2012), 대한설비관리학회
- Kim, W.-S., "On Cycle Time Approximations for the Failure Prone G", G, Proceedings of the 2011 International Conference on Control, pp.2011[DOI]
- Kim, W. -S., "On Equilibrium Probabilities for the Delays in Deterministic Flow Lines with Random Arrivals", IEEE Transactions on Automation Science and Engineering (IEEE), a special issue on selected papers from IEEE CASE 2013, 12(1), pp.62~74 (2015)
- Kim, W. -S., "The Throughput Rate of Serial Production Lines with Deterministic Process Times and Random Setups : Markovian Models and Applications to Semiconductor Manufacturing", Computers and Operations Research, 53(1), pp.288~300 (2015)
- Mitrany, I. L., "A Many-Server Queue with Service Interruptions", Operations Research, 16(3), pp.628~638 (1968)
- Morrison, J. R., "Deterministic Flow Lines with Applications", IEEE Transactions on Automation Science and Engineering, 7(2), pp.228~239 (2010)
- Morrison, J. R., "Practical Extensions to Cycle Time Approximations for the G", G, IEEE Transactions on Automation Science and Engineering, pp.2007, 4(4)[DOI]
- White, H., "Queueing with Preemptive Priorities or with Breakdown", Operations Research, 6, pp.79~95 (1958)
- Whitt, W., "Approximations for the GI", G, Production and Operations Management, pp.1993, 2(2)[DOI]