Journal of Applied Probability
- J. Appl. Probab.
- Volume 48, Number 2 (2011), 435-452.
Managing queues with heterogeneous servers
We consider several versions of the job assignment problem for an M/M/m queue with servers of different speeds. When there are two classes of customers, primary and secondary, the number of secondary customers is infinite, and idling is not permitted, we develop an intuitive proof that the optimal policy that minimizes the mean waiting time has a threshold structure. That is, for each server, there is a server-dependent threshold such that a primary customer will be assigned to that server if and only if the queue length of primary customers meets or exceeds the threshold. Our key argument can be generalized to extend the structural result to models with impatient customers, discounted waiting time, batch arrivals and services, geometrically distributed service times, and a random environment. We show how to compute the optimal thresholds, and study the impact of heterogeneity in server speeds on mean waiting times. We also apply the same machinery to the classical slow-server problem without secondary customers, and obtain more general results for the two-server case and strengthen existing results for more than two servers.
J. Appl. Probab., Volume 48, Number 2 (2011), 435-452.
First available in Project Euclid: 21 June 2011
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Kim, Jung Hyun; Ahn, Hyun-Soo; Righter, Rhonda. Managing queues with heterogeneous servers. J. Appl. Probab. 48 (2011), no. 2, 435--452. doi:10.1239/jap/1308662637. https://projecteuclid.org/euclid.jap/1308662637