The cμ/θ Rule for Many-Server Queues with Abandonment

Authors:
Rami Atar;Chanit Giat;Nahum Shimkin
Affiliations:
Department of Electrical Engineering, Technion--Israel Institute of Technology, Haifa 32000, Israel;Department of Electrical Engineering, Technion--Israel Institute of Technology, Haifa 32000, Israel;Department of Electrical Engineering, Technion--Israel Institute of Technology, Haifa 32000, Israel
Venue:
Operations Research
Year:
2010

Citing 8
Cited 7

Strong approximations for Markovian service networks

Queueing Systems: Theory and Applications
Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules

Operations Research
Commissioned Paper: Telephone Call Centers: Tutorial, Review, and Research Prospects

Manufacturing & Service Operations Management
Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments

Management Science
Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule

Operations Research
Dynamic Routing and Admission Control in High-Volume Service Systems: Asymptotic Analysis via Multi-Scale Fluid Limits

Queueing Systems: Theory and Applications
Fluid Models for Multiserver Queues with Abandonments

Operations Research
Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method

Operations Research

On the asymptotic optimality of the cμ/θ rule under ergodic cost

Queueing Systems: Theory and Applications
Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers

Operations Research
Shadow-Routing Based Control of Flexible Multiserver Pools in Overload

Operations Research
Robust Design and Control of Call Centers with Flexible Interactive Voice Response Systems

Manufacturing & Service Operations Management
Dynamic fluid-based scheduling in a multi-class abandonment queue

Performance Evaluation
Dynamic scheduling of a GI/GI/1+GI queue with multiple customer classes

Queueing Systems: Theory and Applications
Data-stories about (im)patient customers in tele-queues

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a multiclass queueing system with multiple homogeneous servers and customer abandonment. For each customer class i, the holding cost per unit time, the service rate, and the abandonment rate are denoted by ci, μi, and θi, respectively. We prove that under a many-server fluid scaling and overload conditions, a server-scheduling policy that assigns priority to classes according to their index ciμi/θi is asymptotically optimal for minimizing the overall long-run average holding cost. An additional penalty on customer abandonment is easily incorporated into this model and leads to a similar index rule.