March 2015 A queueing loss model with heterogeneous skill based servers under idle time ordering policies
Babak Haji, Sheldon M. Ross
Author Affiliations +
J. Appl. Probab. 52(1): 269-277 (March 2015). DOI: 10.1239/jap/1429282621

Abstract

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.

Citation

Download Citation

Babak Haji. Sheldon M. Ross. "A queueing loss model with heterogeneous skill based servers under idle time ordering policies." J. Appl. Probab. 52 (1) 269 - 277, March 2015. https://doi.org/10.1239/jap/1429282621

Information

Published: March 2015
First available in Project Euclid: 17 April 2015

zbMATH: 1315.60098
MathSciNet: MR3336861
Digital Object Identifier: 10.1239/jap/1429282621

Subjects:
Primary: 60K25
Secondary: 60J27 , 90B22

Keywords: equilibrium distribution , Gibbs sampler , heterogeneous server , limiting probability , method of stages , no-memory policy , queueing loss system , reverse chain

Rights: Copyright © 2015 Applied Probability Trust

JOURNAL ARTICLE
9 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.52 • No. 1 • March 2015
Back to Top