Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic
By Rami Atar, A. Mandelbaum, Martin I. Reiman. 2004
159 citations recorded by the source corpus.
We consider the problem of scheduling a queueing system in which many statistically identical servers cater to several classes of impatient customers. Service times and impatience clocks are exponential while arrival processes are renewal. Our cost is an expected cumulative discounted function, linear or nonlinear, of appropriately normalized performance measures. As a special case, the cost per unit time can be a function of the number of customers waiting to be served in each class, the number actually being served, the abandonment rate, the delay experienced by customers, the number of idling servers, as well as certain combinations thereof. We study the system in an asymptotic heavy-traffic regime where the number of servers n and the offered load r are simultaneously scaled up and carefully balanced: n\approx r+\beta \sqrtr for some scalar \beta. This yields an operation that enjoys the benefits of both heavy traffic (high server utilization) and light traffic (high service levels.)
Subfields: Electrical and Electronic Engineering, Emergency Medical Services, Management Information Systems
View Paper: https://www.semanticscholar.org/paper/c195eb4a44d617ab415a3dfc0456a160fc3272fb
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Electrical and Electronic Engineering
In Management Information Systems
Citations in the corpus
- Steady-state analysis of a multiserver queue in the Halfin-Whitt regime (2007, background): “Optimal stochastic control of QED queues in various settings was examined in [5], [6], [23], and [37]; the problem of joint control and staffing was studied in [7] and [20].”