TY - JOUR
T1 - A loss system with skill based servers under assign to longest idle server policy
AU - Adan, I.J.B.F.
AU - Weiss, G.
PY - 2012
Y1 - 2012
N2 - We consider a memoryless loss system with servers S = {1, …, J}, and with customer types C = {1, …, I}. 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 [1]. We also show that this system is insensitive, the results hold also for general service time distributions.
AB - We consider a memoryless loss system with servers S = {1, …, J}, and with customer types C = {1, …, I}. 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 [1]. We also show that this system is insensitive, the results hold also for general service time distributions.
U2 - 10.1017/S0269964812000034
DO - 10.1017/S0269964812000034
M3 - Article
SN - 0269-9648
VL - 26
SP - 307
EP - 321
JO - Probability in the Engineering and Informational Sciences
JF - Probability in the Engineering and Informational Sciences
IS - 3
ER -