Queues with infinitely many servers
RAIRO-Oper. Res., 14 2 (1980) 109-113
Published online: 2017-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Swarm based Heuristic Optimization of the Recurrent Customers and Standby Server Under General Retrial Times
N. Micheal Mathavavisakan, K. Indhira and Aliakbar Montazer HaghighiInternational Journal of Mathematical, Engineering and Management Sciences 10 (4) 931 (2025)
https://doi.org/10.33889/IJMEMS.2025.10.4.045
A central limit theorem for a Markov-modulated infinite-server queue with batch Poisson arrivals and binomial catastrophes
Moeko Yajima and Tuan Phung-DucPerformance Evaluation 129 2 (2019)
https://doi.org/10.1016/j.peva.2018.10.002
1 (2016)
https://doi.org/10.1145/3016032.3016046
Asymptotic Blocking Probabilities in Loss Networks with Subexponential Demands
Yingdong Lu and Ana RadovanovićJournal of Applied Probability 44 (4) 1088 (2007)
https://doi.org/10.1239/jap/1197908827
Asymptotic Blocking Probabilities in Loss Networks with Subexponential Demands
Yingdong Lu and Ana RadovanovićJournal of Applied Probability 44 (04) 1088 (2007)
https://doi.org/10.1017/S0021900200003764
TheGr X n/G n/∞ system: System size
Liming Liu and J. G. C. TempletonQueueing Systems 8 (1) 323 (1991)
https://doi.org/10.1007/BF02412259