Journal of Applied Probability
- J. Appl. Probab.
- Volume 52, Number 1 (2015), 269-277.
A queueing loss model with heterogeneous skill based servers under idle time ordering policies
We consider a queueing loss system with heterogeneous skill based servers with arbitrary service distributions. We assume Poisson arrivals, with each arrival having a vector indicating which of the servers are eligible to serve it. An arrival can only be assigned to a server that is both idle and eligible. Assuming exchangeable eligibility vectors and an idle time ordering assignment policy, the limiting distribution of the system is derived. It is shown that the limiting probabilities of the set of idle servers depend on the service time distributions only through their means. Moreover, conditional on the set of idle servers, the remaining service times of the busy servers are independent and have their respective equilibrium service distributions.
J. Appl. Probab., Volume 52, Number 1 (2015), 269-277.
First available in Project Euclid: 17 April 2015
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Haji, Babak; Ross, Sheldon M. A queueing loss model with heterogeneous skill based servers under idle time ordering policies. J. Appl. Probab. 52 (2015), no. 1, 269--277. doi:10.1239/jap/1429282621. https://projecteuclid.org/euclid.jap/1429282621