Shadow-Routing Based Control of Flexible Multiserver Pools in Overload

Alexander Stolyar · Tolga Tezcan

30 citations0/0 files storedOperations Research

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Healthcare Operations and Scheduling Optimization Optimization and Search Problems

Abstract

We consider a general parallel server system model with multiple customer classes and several flexible multiserver pools, in the many-server asymptotic regime where the input rates and server pool sizes are scaled up linearly to infinity. Service of a customer brings a constant reward, which depends on its class. The objective is to maximize the long-run reward rate. Our primary focus is on overloaded systems. Unlike in the case when the system is not overloaded, where the main decision is how to allocate resources to incoming customers, in this case it is also crucial to determine which customers will be admitted to the system. We propose a real-time, parsimonious, robust routing policy, SHADOW-RM, which does not require the knowledge of customer input rates and does not solve any optimization problem explicitly, and we prove its asymptotic optimality. Then, by combining SHADOW-RM with another policy, SHADOW-LB, proposed in our previous work for systems that are not overloaded, we suggest policy SHADOW-TANDEM, which automatically and seamlessly detects overload and reduces to one of the schemes, SHADOW-RM or SHADOW-LB, accordingly. Extensive simulations demonstrate a remarkably good performance of proposed policies.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 30 citations exist upstream.

References

2003Telephone Call Centers: Tutorial, Review, and Research Prospects 2007The Modern Call Center: A Multi‐Disciplinary Perspective on Operations Management Research 2004Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule 2006Fluid Models for Multiserver Queues with Abandonments 2009The G/GI/N queue in the Halfin–Whitt regime 2006Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method 2009Service-Level Differentiation in Many-Server Service Systems via Queue-Ratio Routing 2004Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments

Cited by

2014Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints 2013Systems with large flexible server pools: Instability of “natural” load balancing 2012Robust Design and Control of Call Centers with Flexible Interactive Voice Response Systems 2012Tightness of invariant distributions of a large-scale flexible service system under a priority discipline

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.