Author:
Adan Ivo,Hurkens Cor,Weiss Gideon
Abstract
We consider a memoryless Erlang loss system with servers= {1, …,J}, and with customer types= {1, …,I}. Servers are multitype, so that serverjcan serve a subset of customer typesC(j). We show that the probabilities of assigning arriving customers to idle servers can be chosen in such a way that the Markov process describing the system is reversible, with a simple product form stationary distribution. Furthermore, the system is insensitive; these properties are preserved for general service time distributions.
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Reference17 articles.
1. Load balancing for redundant storage strategies: Multiprocessor scheduling with machine eligibility
2. 15. Visschers J.W.C.H. (2000). Random walks with geometric jumps. Ph.D. thesis, Eindhoven University of Technology.
3. 10. Garnett O. & Mandelbaum A. (2000). An introduction to skill-based routing and its operational complexities. Available from http://iew3.technion.ac.il/serveng/Lectures/SBR.pdf
4. Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
5. 16. Visschers J.W.C.H. , Adan I.J.B.F. , & Weiss G. (2009). A multi-class multi-server system with customer-class service restrictions. Preprint.
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Token-Based Central Queue with Order-Independent Service Rates;Operations Research;2022-01
2. Index;Scheduling and Control of Queueing Networks;2021-10-31
3. References;Scheduling and Control of Queueing Networks;2021-10-31
4. Parallel Servers with Skill-Based Routing;Scheduling and Control of Queueing Networks;2021-10-31
5. Load Balancing in the Supermarket Model;Scheduling and Control of Queueing Networks;2021-10-31