We consider a memoryless loss system with servers , and with customer types Servers are multi-type: server j works at rate μj, and can serve a subset of customer types C(j). An arriving customer will go to the longest idling server which can serve him, or be lost. We obtain a simple explicit steady-state distribution for this system, and calculate various performance measures of this system in steady state. We provide some illustrative examples. We compare this system with a similar system discussed recently by Adan, Hurkens, and Weiss . We also show that this system is insensitive, the results hold also for general service time distributions.
|Number of pages||15|
|Journal||Probability in the Engineering and Informational Sciences|
|State||Published - Jul 2012|
Bibliographical noteFunding Information:
Research of the author Ivo Adan was supported in part by the Netherlands Organization for Scientific Research (NWO).
Research of the author Gideon Weiss was supported in part by Israel Science Foundation Grant 711/09.
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Management Science and Operations Research
- Industrial and Manufacturing Engineering