Article thumbnail

A loss system with skill based servers under assign to longest idle server policy

By IJBF Ivo Adan and Gideon Weiss


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 [2]. We also show that this system is insensitive, the results hold also for general processing time distributions. Keywords: Service system; loss system; multi type customers; multi type servers; product form solution; go to longest waiting server policy; insensitivity

Topics: queuing theory, queuing theory
Publisher: Eurandom
Year: 2011
OAI identifier:
Provided by: Repository TU/e
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.