Price Faculty of Engineering Scholarly Works
Permanent URI for this collection
Browse
Browsing Price Faculty of Engineering Scholarly Works by Author "Chakravarthy, S."
Now showing 1 - 2 of 2
Results Per Page
Sort Options
- ItemOpen AccessA discrete single server queue with Markovian arrivals and phase type group services(1995-1-1) Alfa, Attahiru Sule; Dolhun, K. Laurie; Chakravarthy, S.We consider a single-server discrete queueing system in which arrivals occur according to a Markovian arrival process. Service is provided in groups of size no more than M customers. The service times are assumed to follow a discrete phase type distribution, whose representation may depend on the group size. Under a probabilistic service rule, which depends on the number of customers waiting in the queue, this system is studied as a Markov process. This type of queueing system is encountered in the operations of an automatic storage retrieval system. The steady-state probability vector is shown to be of (modified) matrix-geometric type. Efficient algorithmic procedures for the computation of the rate matrix, steady-state probability vector, and some important system performance measures are developed. The steady-state waiting time distribution is derived explicitly. Some numerical examples are presented.
- ItemOpen AccessA finite capacity queue with Markovian arrivals and two servers with group services(1994-1-1) Chakravarthy, S.; Alfa, Attahiru SuleIn this paper we consider a finite capacity queuing system in which arrivals are governed by a Markovian arrival process. The system is attended by two exponential servers, who offer services in groups of varying sizes. The service rates may depend on the number of customers in service. Using Markov theory, we study this finite capacity queuing model in detail by obtaining numerically stable expressions for (a) the steady-state queue length densities at arrivals and at arbitrary time points; (b) the Laplace-Stieltjes transform of the stationary waiting time distribution of an admitted customer at points of arrivals. The stationary waiting time distribution is shown to be of phase type when the interarrival times are of phase type. Efficient algorithmic procedures for computing the steady-state queue length densities and other system performance measures are discussed. A conjecture on the nature of the mean waiting time is proposed. Some illustrative numerical examples are presented.