On the asymptotic optimality of the cμ/θ rule under ergodic cost
暂无分享,去创建一个
We consider an overloaded multi-server multi-class queueing model where customers may abandon while waiting to be served. For class i, service is provided at rate μi, and abandonment occurs at rate θi. In a many-server fluid regime, we show that prioritizing the classes in decreasing order of ciμi/θi asymptotically minimizes an ergodic holding cost, where ci denotes the equivalent holding cost per unit time for class i.
[1] Ward Whitt,et al. An Introduction to Stochastic-Process Limits and their Application to Queues , 2002 .
[2] Sean P. Meyn. Control Techniques for Complex Networks: Workload , 2007 .
[3] N. Shimkin,et al. The c / Rule for Many-Server Queues with Abandonment , 2009 .
[4] Philippe Robert. Stochastic Networks and Queues , 2003 .