• 대한수학회논문집
• /
• 제25권4호
• /
• pp.647-653
• /
• 2010

We consider an M/M/1 retrial queue with collision and impatience. It is shown that the generating functions of the joint distributions of the server state and the number of customers in the orbit at steady state can be expressed in terms of the confluent hypergeometric functions. We find the performance characteristics of the system such as the blocking probability and the mean number of customers in the orbit.

• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2004년도 학술발표논문집
• /
• pp.289-294
• /
• 2004

We consider M/G/1 queue in which the customers are classified into n+1 classes by their impatience time. First, we analyze the model of two types of customers; one is the customer with constant impatience duration k and the other is patient customer. The expected busy period of the server and the limiting distribution of the virtual waiting time process are obtained. Then, the model is generalized to the one in which there are classes of customers according to their impatience duration.

• 응용통계연구
• /
• 제7권2호
• /
• pp.21-34
• /
• 1994

본 논문에서 대기체계 M/M/1에서 평균 도착시간간격 $\theta$에 대한, 평형상태에서 평균시스템시간 (Steady State Mean System Time) W의 민감도 $dW/d\theta$를 표본통로(Sample Path)를 관찰하므로서 얻을 수 있는 방안을 제시하였으며, 평형상태에서 시스템 내에 고객이 k명 있을 확률, 즉 극한 확률(Limiting Probability) $P_k$의 민감도 $dP_k/d\theta$에 대해서도 유사한 결과를 얻었다. 또한 두 경우 모두 민감도의 추정값이 IPA(Infinitesimal Perturbation Analysis) 추정값과 그 이외의 요인에 의한 값의 합으로 명확히 표시됨을 보임으로서 IPA 추정값이 일반적으로 적용될 수 없음을 확인하였다.

• Journal of the Korean Statistical Society
• /
• 제30권4호
• /
• pp.661-666
• /
• 2001

In this paper we consider an M/G/1 queue where the server of the system has a vacation time and the service policy is limited-1. In this system, upon termination of a vacation the server returns to the queue and serves at most one message in the queue before taking another vacation. We consider two models. In the first, if the sever finds the queue empty at the end of a cacation, then the sever immediately takes another vacation. In the second model, if no message have arrived during a vacation, the sever waits for the first arrival to serve. The analysis of this system is particularly useful for a priority class polling system. We derive Laplace-Stieltjes transforms of the waiting time for both models, and compare their mean waiting times.

• Management Science and Financial Engineering
• /
• 제12권2호
• /
• pp.1-18
• /
• 2006

We consider an $M^x/G/1$ queueing system with Bernoulli vacation schedule under multiple vacation policy. where after each vacation completion or service completion the server takes sequence of vacations until a batch of new customer arrive. This generalizes both $M^x/G/1$ queueing system with multiple vacation as well as M/G/1 Bernoulli vacation model. We carryout an extensive analysis for the queue size distributions at various epochs. Further attempts have been made to unify the results of related batch arrival vacation models.

• 충청수학회지
• /
• 제27권3호
• /
• pp.405-411
• /
• 2014

Queueing systems with retrials are widely used to model many problems in call centers, telecommunication networks, and in daily life. We present a very accurate but simple approximate formula for the distribution of the number of retrying customers in the M/G/1 retrial queue.

• 대한산업공학회지
• /
• 제26권3호
• /
• pp.206-212
• /
• 2000

We consider the M/M/1/1 retrial queue where the maximum number of retrials is fixed by a constant. We present an efficient approximate procedure for mean performance measures and the loss probability. The approximate results are satisfactory when compared with simulation results.

• 대한산업공학회지
• /
• 제27권1호
• /
• pp.11-17
• /
• 2001

We consider the M/G/1 with Bernoulli feedback, where the served customers wait in the feedback queue for rework with probability p. It is important to decide the moment of dispatching in feedback systems because of the dispatching cost for rework. Up to date, researches have analyzed for the instantaneous-dispatching model or the case that dispatching epoch is determined by the state of feedback queue. In this paper we deal with a dispatching model whose dispatching epoch depends on main queue. We adopt supplementary variable method for our model and a numerical example is given for clarity.

• 대한산업공학회지
• /
• 제28권3호
• /
• pp.247-255
• /
• 2002

The objective of this paper is to clarify the decomposition property for $M^{X}$/G/1 queues with generalized vacations so that the decomposition property is better understood and becomes more applicable. As an example model, we use the $M^{X}$/G/1 queue with setup time. For this queue, we correct Choudhry's (2000) steady-state queue size PGF and derive the steady-state waiting time LST. We also present a meaningful interpretation for the decomposed steady-state waiting time LST.

• 대한산업공학회지
• /
• 제25권4호
• /
• pp.527-531
• /
• 1999

Instead of using the expected unfinished work, we use the expected number of customers in the system for finding the optimal D-policy for the M/G/1 queue in order to make it consistent with other control policies such as N-policy and T-policy.