Customer Abandonment in Many-Server Queues

Jim G. Dai · Shuangchi He

94 citations0/0 files storedMathematics of Operations 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 Stochastic processes and statistical mechanics Probability and Risk Models

Abstract

We study G/G/n + GI queues in which customer patience times are independent, identically distributed following a general distribution. When a customer's waiting time in queue exceeds his patience time, the customer abandons the system without service. For the performance of such a system, we focus on the abandonment process and the queue length process. We prove that under some conditions, a deterministic relationship between the two stochastic processes holds asymptotically under the diffusion scaling when the number of servers n goes to infinity. These conditions include a minor assumption on the arrival processes that can be time-nonhomogeneous and a key assumption that the sequence of diffusion-scaled queue length processes, indexed by n, is stochastically bounded. We also establish a comparison result that allows one to verify the stochastic boundedness by studying a corresponding sequence of systems without customer abandonment.

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 — 94 citations exist upstream.

References

2005Stochastic Integration and Differential Equations 2003Telephone Call Centers: Tutorial, Review, and Research Prospects 2005Statistical Analysis of a Telephone Call Center 1981Heavy-Traffic Limits for Queues with Many Exponential Servers 2007The Modern Call Center: A Multi‐Disciplinary Perspective on Operations Management Research 2002Designing a Call Center with Impatient Customers 1970Multiple channel queues in heavy traffic. I 1955On the theory of queues with many servers

Cited by

2015Staffing and scheduling under nonstationary demand for service: A literature review 2011Asymptotic analysis of queueing systems with reneging: A survey of results for FIFO, single class models 2019Economies-of-Scale in Many-Server Queueing Systems: Tutorial and Partial Review of the QED Halfin--Whitt Heavy-Traffic Regime 2012On scheduling a multiclass queue with abandonments under general delay costs 2013Steady-state $GI/G/n$ queue in the Halfin–Whitt regime

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.