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

Authors:
Tolga Tezcan;J. G. Dai
Affiliations:
Industrial and Enterprise Systems Engineering, University of Illinois at Urbana--Champaign, Urbana, Illinois 61801;H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
Venue:
Operations Research
Year:
2010

Citing 15
Cited 11

Data networks

Data networks
Strong approximations for Markovian service networks

Queueing Systems: Theory and Applications
Heavy traffic resource pooling in parallel-server systems

Queueing Systems: Theory and Applications
Designing a Call Center with Impatient Customers

Manufacturing & Service Operations Management
Commissioned Paper: Telephone Call Centers: Tutorial, Review, and Research Prospects

Manufacturing & Service Operations Management
Pricing and Capacity Sizing for Systems with Shared Resources: Approximate Solutions and Scaling Relations

Management Science
Dimensioning Large Call Centers

Operations Research
Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime

Operations Research
On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design

Operations Research
Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule

Operations Research
Dynamic Routing in Large-Scale Service Systems with Heterogeneous Servers

Queueing Systems: Theory and Applications
Call-Routing Schemes for Call-Center Outsourcing

Manufacturing & Service Operations Management
Contact Centers with a Call-Back Option and Real-Time Delay Information

Operations Research
Optimal control of parallel server systems with many servers in heavy traffic

Queueing Systems: Theory and Applications
Service-Level Differentiation in Call Centers with Fully Flexible Servers

Management Science

The Value of Partial Resource Pooling: Should a Service Network Be Integrated or Product-Focused?

Management Science
Queue-and-Idleness-Ratio Controls in Many-Server Service Systems

Mathematics of Operations Research
Control of systems with flexible multi-server pools: a shadow routing approach

Queueing Systems: Theory and Applications
The n-network model with upgrades

Probability in the Engineering and Informational Sciences
Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers

Operations Research
State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems

Mathematics of Operations Research
Shadow-Routing Based Control of Flexible Multiserver Pools in Overload

Operations Research
Multiclass multiserver queueing system in the Halfin---Whitt heavy traffic regime: asymptotics of the stationary distribution

Queueing Systems: Theory and Applications
Stability analysis of N-model systems under a static priority rule

Queueing Systems: Theory and Applications
Steady-State Analysis for Multiserver Queues Under Size Interval Task Assignment in the Quality-Driven Regime

Mathematics of Operations Research
Dynamic scheduling of a GI/GI/1+GI queue with multiple customer classes

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.01

Visualization

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.