Dynamic control of N-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic
Journal
Operations Research
Subject
Management Science and Operations
Publishing details
Publication Year
2010
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ì-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
Available on ECCH
No
