The c(mu)/(theta) Rule for Many-Server Queues with Abandonment

Rami Atar (), Chanit Giat () and Nahum Shimkin ()
Additional contact information
Rami Atar: Department of Electrical Engineering, Technion--Israel Institute of Technology, Haifa 32000, Israel
Chanit Giat: Department of Electrical Engineering, Technion--Israel Institute of Technology, Haifa 32000, Israel
Nahum Shimkin: Department of Electrical Engineering, Technion--Israel Institute of Technology, Haifa 32000, Israel

Operations Research, 2010, vol. 58, issue 5, 1427-1439

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 c i , (mu) i , and (theta) 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 c i (mu) i / (theta) 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.

Keywords: multiclass queue; customer abandonment; fluid limits (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1100.0826 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:58:y:2010:i:5:p:1427-1439

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().