Dynamic Control of N -Systems with Many Servers: Asymptotic Optimality of a Static Priority Policy in Heavy Traffic

Tolga Tezcan () and J. G. Dai ()
Additional contact information
Tolga Tezcan: Industrial and Enterprise Systems Engineering, University of Illinois at Urbana--Champaign, Urbana, Illinois 61801
J. G. Dai: H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332

Operations Research, 2010, vol. 58, issue 1, 94-110

Abstract: We consider a class of parallel server systems that are known as N -systems. In an N -system, there are two customer classes that are catered by servers in two pools. Servers in one of the pools are cross-trained and can serve customers from both classes, whereas all of the servers in the other pool can serve only one of the customer classes. A customer reneges from his queue if his waiting time in the queue exceeds his patience. Our objective is to minimize the total cost that includes a linear holding cost and a reneging cost. We prove that, when the service speed is pool dependent, but not class dependent, a c(mu) -type greedy policy is asymptotically optimal in many-server heavy traffic.

Keywords: N-systems; parallel server systems; asymptotic optimality; many-server limit; heavy-traffic limit; Halfin-Whitt regime (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (28)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1080.0668 (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:1:p:94-110

Access Statistics for this article

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