Abstract
Many queueing situations such as computer, communications and emergency systems have the feature that customers may require service from several servers at the same time. They may thus be delayed until the required number of servers is available and servers may be idle when customers are waiting. We consider general server-completion-time distributions and derive approximation methods for the computation of the steady-state distribution of the number of customers in queue as well as the moments of the waiting-time distribution. Extensive computational results are reported. Refs.
Original language | English |
---|---|
Pages (from-to) | 583-601 |
Number of pages | 19 |
Journal | Journal of Applied Probability |
Volume | 21 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1984 |
ASJC Scopus Subject Areas
- Statistics and Probability
- General Mathematics
- Statistics, Probability and Uncertainty
Fingerprint
Dive into the research topics of 'M/G/c QUEUE IN WHICH THE NUMBER OF SERVERS REQUIRED IS RANDOM.'. Together they form a unique fingerprint.Cite this
Federgruen, A., & Green, L. (1984). M/G/c QUEUE IN WHICH THE NUMBER OF SERVERS REQUIRED IS RANDOM. Journal of Applied Probability, 21(3), 583-601. https://doi.org/10.1017/S0021900200028783