• Communications for Statistical Applications and Methods
• /
• 제19권1호
• /
• pp.169-175
• /
• 2012

The sensitivity of the performance measures such as the mean and the standard deviation of the queue length and the blocking probability with respect to the moments of the service time are numerically investigated. The service time distribution is fitted with phase type(PH) distribution by matching the first three moments of service time and the M/G/c retrial queue is approximated by the M/PH/c retrial queue. Approximations are compared with the simulation results.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제19권4호
• /
• pp.443-457
• /
• 2015

We consider the M/M/c/c queues in which the customers blocked to enter the service facility retry after a random amount of time and some of idle servers can leave the vacation. The vacation time and retrial time are assumed to be of phase type distribution. Approximation formulae for the distribution of the number of customers in service facility and the mean number of customers in orbit are presented. We provide an approximation for M/M/c/c queue with general retrial time and general vacation time by approximating the general distribution with phase type distribution. Some numerical results are presented.

• 산업경영시스템학회지
• /
• 제30권1호
• /
• pp.33-40
• /
• 2007

A multi-server queueing system with finite buffer is considered. The input flow is the BMAP (Batch Markovian Arrival Process). The service time has the PH (Phase) type distribution. Customers from the BMAP enter the system according to the discipline of partial admission. Besides ordinary (positive) customers, the Markovian flow (MAP) of negative customers arrives to the system. A negative customer can delete an ordinary customer in service if the state of its PH-service process belongs to some given set. In opposite case the ordinary customer is considered to be protected of the effect of negative customers. The stationary distribution and the main performance measures of the considered queueing system are calculated.

• Industrial Engineering and Management Systems
• /
• 제12권3호
• /
• pp.281-287
• /
• 2013

In this paper, we introduce a roots method that uses the roots inside the unit circle of the associated characteristics equation to evaluate the steady-state system-length distribution at three epochs (pre-arrival, arbitrary, and post-departure) and sojourn-time distribution in GI/PH/1 queueing model. It is very important for an air base to inspect airplane oil because low-quality oil leads to drop or breakdown of an airplane. Since airplane oil inspection is composed of several inspection steps, it sometimes causes train congestion and delay of inventory replenishments. We analyzed interarrival time and inspection (service) time of oil supply from the actual data which is given from one of the ROKAF's (Republic of Korea Air Force) bases. We found that interarrival time of oil follows a normal distribution with a small deviation, and the service time follows phase-type distribution, which was first introduced by Neuts to deal with the shortfalls of exponential distributions. Finally, we applied the GI/PH/1 queueing model to the oil train congestion problem and analyzed the distributions of the number of customers (oil trains) in the queue and their mean sojourn-time using the roots method suggested by Chaudhry for the model GI/C-MSP/1.

• 대한수학회보
• /
• 제43권2호
• /
• pp.277-292
• /
• 2006

We consider a single-server queue with service time distribution of phase type where positive customers, negative customers and disasters arrive according to a Markovian arrival process with marked transitions (MMAP). We derive simple formulae for the stationary queue length distributions. The Laplace-Stieltjes transforms (LST's) of the sojourn time distributions under the combinations of removal policies and service disciplines are also obtained by using the absorption time distribution of a Markov chain.

• 한국경영과학회지
• /
• 제38권3호
• /
• pp.13-22
• /
• 2013

Queueing system with scheduled arrivals is useful in many fields where both customers' waiting time and servers' operation time (utilization) are important, and arrival time of customers is possible to be controlled. In this paper, we analyzed the operation of ship maintenance with the queueing system with scheduled arrival. Based on the model presented by Pegden and Rosenshine [8], who dealt with exponential service time, we extended the service time distributions to phase-type distribution which is able to include a wide range of real stochastic phenomena. Since most activities in the military are carried out under tight control and schedule, scheduled arrival queue has quite good applicability in this area. In this context, we applied queue with scheduled arrival to the optimal booking time decision for the ship maintenance in the navy.

• 대한수학회논문집
• /
• 제28권2호
• /
• pp.383-396
• /
• 2013

We consider an M/PH/1 queue with deterministic impatience time. An exact analytical expression for the stationary distribution of the workload is derived. By modifying the workload process and using Markovian structure of the phase-type distribution for service times, we are able to construct a new Markov process. The stationary distribution of the new Markov process allows us to find the stationary distribution of the workload. By using the stationary distribution of the workload, we obtain performance measures such as the loss probability, the waiting time distribution and the queue size distribution.

• Journal of applied mathematics & informatics
• /
• 제30권5_6호
• /
• pp.749-757
• /
• 2012

We consider the M/PH,G/1 queue with two classes of customers in which class-1 customers have deterministic impatience time and have preemptive priority over class-2 customers who are assumed to be infinitely patient. The service times of class-1 and class-2 customers have a phase-type distribution and a general distribution, respectively. We obtain performance measures of class-2 customers such as the queue length distribution, the waiting time distribution and the sojourn time distribution, by analyzing the busy period of class-1 customers. We also compute the moments of the queue length and the waiting and sojourn times.

• 대한수학회지
• /
• 제38권4호
• /
• pp.807-842
• /
• 2001

This paper summarizes recent development of analytical and algorithmical results for stationary FIFO queues with multiple Markovian arrival streams, where service time distributions are general and they may differ for different arrival streams. While this kind of queues naturally arises in considering queues with a superposition of independent phase-type arrivals, the conventional approach based on the queue length dynamics (i.e., M/G/1 pradigm) is not applicable to this kind of queues. On the contrary, the workload process has a Markovian property, so that it is analytically tractable. This paper first reviews the results for the stationary distributions of the amount of work-in-system, actual waiting time and sojourn time, all of which were obtained in the last six years by the author. Further this paper shows an alternative approach, recently developed by the author, to analyze the joint queue length distribution based on the waiting time distribution. An emphasis is placed on how to construct a numerically feasible recursion to compute the stationary queue length mass function.

• 대한수학회보
• /
• 제53권4호
• /
• pp.985-1004
• /
• 2016

We consider the MAP/PH/c/K queue in which blocked customers retry to get service and servers may take vacations. The time interval between retrials and vacation times are of phase type (PH) distributions. Using the method of mean drift, a sufficient condition of ergodicity is provided. A condition for the system to be unstable is also given by the stochastic comparison method.