论文信息 - The cμ/θ rule

The cμ/θ rule

We consider a multi-class queueing system with customer abandonment. For class i, the holding cost per unit time, the service rate and the abandonment rate are denoted by ci, μi and θi, respectively. Our results show that under a manyserver fluid scaling and heavy traffic conditions, a routing policy that assigns non-preemptive priority to classes according to their index ciμi/θi, is asymptotically optimal for minimizing the overall long run average holding cost.

Nahum Shimkin | Rami Atar | Chanit Giat

[1] J. Ben Atkinson,et al. An Introduction to Queueing Networks , 1988 .

[2] Avishai Mandelbaum,et al. Telephone Call Centers: Tutorial, Review, and Research Prospects , 2003, Manuf. Serv. Oper. Manag..

[3] Zeynep Akşin,et al. The Modern Call Center: A Multi‐Disciplinary Perspective on Operations Management Research , 2007 .

[4] J. V. Mieghem. Dynamic Scheduling with Convex Delay Costs: The Generalized CU Rule , 1995 .

[5] Ward Whitt,et al. Fluid Models for Multiserver Queues with Abandonments , 2006, Oper. Res..

[6] Alexander L. Stolyar,et al. Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule , 2004, Oper. Res..

[7] J. Michael Harrison,et al. Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method , 2006, Oper. Res..

[8] Jan A. Van Mieghem. Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules , 2003, Oper. Res..