Skip to main content

Please enter a keyword and click the arrow to search the site

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

Authors / Editors

Tezcan T;Dai J G

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


Select up to 4 programmes to compare

Select one more to compare
×
subscribe_image_desktop 5949B9BFE33243D782D1C7A17E3345D0

Sign up to receive our latest news and business thinking direct to your inbox

×

Sign up to receive our latest course information and business thinking

Leave your details above if you would like to receive emails containing the latest thought leadership, invitations to events and news about courses that could enhance your career. If you would prefer not to receive our emails, you can still access the case study by clicking the button below. You can opt-out of receiving our emails at any time by visiting: https://london.edu/my-profile-preferences or by unsubscribing through the link provided in our emails. View our Privacy Policy for more information on your rights.