One-node closed multichannel service system: several types of customers and service rates, and random pick-up from the waiting line
Authors:
- O. BronshteinOBO. Bronshtein
- I. GertsbakhIGI. Gertsbakh
- B. PittelBPB. Pittel
- S. ShahafSSS. Shahaf
- 1 June 1987
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 19 (2) , 487-504
Abstract
A closed queueing system has Q service channels and a waiting line. There are Ni customers of type i in the system, i = 1, ···, m, ∑mi=1Ni = N > Q. Q customers are served and Q0 = N – Q stay in the waiting line. Q channels are partitioned into n groups with Qj channels in the jth group, j = 1, ···, n. The service time of the ith type customer by a channel of the jth group is τij ~ Exp (λij). When a customer leaves the channel, it is immediately replaced by another one picked up randomly from the waiting time. The customer which has cleared service joins the waiting line without delay. Let Xij be the number of ith type customers served by jth group channels in equilibrium. An explicit formula for P(Xij = kij, i = 1, ···, m; j = 1, ···, n) is found. It is shown in a form of a local limit theorem that the asymptotic distribution of {Xij} is a multidimensional normal, if Qj/N and Qj/N have positive limits as N → ∞. Formulas for mean values and covariances are given. It turns out that the means of Xij and covariances between Xij and Xrk can be found, using an efficient iterative algorithm, from the deterministic version of the system. A numerical example demonstrates that the normal approximation is rather accurate.Keywords
This publication has 11 references indexed in Scilit:
- Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic AnalysisMathematics of Operations Research, 1979
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Networks of queues with customers of different typesJournal of Applied Probability, 1975
- Approximations for the repairman problem with two repair facilities, II: SparesAdvances in Applied Probability, 1974
- Approximations for the repairman problem with two repair facilities, I: No sparesAdvances in Applied Probability, 1973
- Solutions of ordinary differential equations as limits of pure jump markov processesJournal of Applied Probability, 1970
- Closed Queuing Systems with Exponential ServersOperations Research, 1967
- Proof of the convergence of Sheleikhovskii's method for a problem with transportation constraintsUSSR Computational Mathematics and Mathematical Physics, 1967
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic MatricesThe Annals of Mathematical Statistics, 1964
- An Algorithm for Computing Interzonal Transfers Using the Gravity ModelOperations Research, 1963