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

• 成果类型: Article
• 署名作者: Tezcan, Tolga; Dai, J. G.
• 署名单位: University of Illinois System; University of Illinois Urbana-Champaign; University System of Georgia; Georgia Institute of Technology
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.1080.0668
• 发表日期: 2010
• 页码: 94-110
• 关键词: open processing networks; call-back option; scheduling control; parallel servers; queuing-networks; contact centers; LIMITS

摘要

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.