낮은 교통밀도 하에서 서버 고장을 고려한 복수 서버 대기행렬 모형의 체제시간에 대한 분석

• 영문명: On the Exact Cycle Time of Failure Prone Multiserver Queueing Model Operating in Low Loading
• 발행기관: 한국산업경영시스템학회
• 저자명: 김우성(Woo Sung Kim) 임대은(Dae Eun Lim)
• 간행물 정보: 『산업경영시스템학회지』제39권 제2호, 1~10쪽, 전체 10쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2016.06.30

영문 초록

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

1. 서론

2. 서비스 시간이 단계형 확률변수를 따르는 대기행렬 모형 분석

3. 서비스 시간이 일반 분포를 따른 대기행렬모형 분석

4. 응용 사례

5. 결론

Acknowledgement

References

키워드

G/G/m Queue Mean Cycle Time Approximation Failure Prone Queue Absorbing Markov Chain