Diffusion Approximation for Efficiency-Driven Queues When Customers Are Patient

DOI10.1287/OPRE.2019.1917zbMATH Open1451.90047arXiv1506.06309OpenAlexW3026254773MaRDI QIDQ3387967FDOQ3387967

Authors: Shuangchi He 

Publication date: 8 January 2021

Published in: Operations Research (Search for Journal in Brave)

Abstract: Motivated by call center practice, we propose a tractable model for $mboxGI/mboxGI/n+mboxGI$ queues in the efficiency-driven (ED) regime. We use a one-dimensional diffusion process to approximate the virtual waiting time process that is scaled in both space and time, with the number of servers and the mean patience time as the respective scaling factors. Using this diffusion model, we obtain the steady-state distributions of virtual waiting time and queue length, which in turn yield simple formulas for performance measures such as the service level and the effective abandonment fraction. These formulas are generally accurate when the mean patience time is several times longer than the mean service time and the patience time distribution does not change rapidly around the mean virtual waiting time. For practical purposes, these formulas outperform existing results that rely on the exponential service time assumption. To justify the diffusion model, we formulate an asymptotic framework by considering a sequence of queues, in which both the number of servers and the mean patience time go to infinity. We prove that the space-time scaled virtual waiting time process converges in distribution to the one-dimensional diffusion process. A fundamental result for proving the diffusion limit is a functional central limit theorem (FCLT) for the superposition of renewal processes. We prove that the superposition of many independent, identically distributed stationary renewal processes, after being centered and scaled in space and time, converges in distribution to a Brownian motion. As a useful technical tool, this theorem characterizes the service completion process in heavy traffic, allowing us to greatly simplify the many-server analysis when service times follow a general distribution.

Full work available at URL: https://arxiv.org/abs/1506.06309

Recommendations

• scientific article; zbMATH DE number 1096972
• A unified approach to diffusion analysis of queues with general patience-time distributions
• On some diffusion approximations to queueing systems
• Refining diffusion approximations for queues
• Diffusion approximation to a queueing system with time-dependent arrival and service rates
• Diffusion approximations of queueing networks
• A consistent diffusion approximation for finite-capacity multiserver queues
• scientific article; zbMATH DE number 1285806
• scientific article; zbMATH DE number 3968286
• scientific article; zbMATH DE number 3954016

zbMATH Keywords

renewal processcovariance functionGaussian processfunctional central limit theoremmany-server queueefficiency-driven regime

Mathematics Subject Classification ID

Diffusion processes (60J60) Queues and service in operations research (90B22) Functional limit theorems; invariance principles (60F17)

Cites Work

• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Title not available (Why is that?)
• Fluid models of many-server queues with abandonment
• SPDE limits of many-server queues
• Many-server diffusion limits for \(G/Ph/n+GI\) queues
• Queues with many servers and impatient customers
• Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments
• Customer abandonment in many-server queues
• Fluid Models for Multiserver Queues with Abandonments
• Asymptotic approximations for stationary distributions of many-server queues with abandonment
• Refined models for efficiency-driven queues with applications to delay announcements and staffing
• Fluid limits of many-server queues with reneging
• Law of large numbers limits for many-server queues
• Martingale proofs of many-server heavy-traffic limits for Markovian queues
• Title not available (Why is that?)
• On the accuracy of fluid models for capacity sizing in queueing systems with impatient customers
• Dimensioning Large Call Centers
• Staffing to maximize profit for call centers with alternate service-level agreements
• Statistical Analysis of a Telephone Call Center
• Many-server heavy-traffic limit for queues with time-varying parameters
• Staffing many-server queues with impatient customers: constraint satisfaction in call centers
• Approximating the GI/GI/1+GI queue with a nonlinear drift diffusion: hazard rate scaling in heavy traffic
• An overloaded multiclass FIFO queue with abandonments
• Hazard Rate Scaling of the Abandonment Distribution for the GI/M/n + GI Queue in Heavy Traffic
• Queues with superposition arrival processes in heavy traffic
• A diffusion regime with nondegenerate slowdown
• Data-stories about (im)patient customers in tele-queues
• How Multiserver Queues Scale with Growing Congestion-Dependent Demand
• Many-server queues with customer abandonment: numerical analysis of their diffusion model
• On Moment Generating Functions and Renewal Theory
• Rare-event simulation for many-server queues

Cited In (5)

• Title not available (Why is that?)
• Steady‐state diffusion approximations for discrete‐time queue in hospital inpatient flow management
• A unified approach to diffusion analysis of queues with general patience-time distributions
• To pool or not to pool: queueing design for large-scale service systems
• Title not available (Why is that?)

This page was built for publication: Diffusion Approximation for Efficiency-Driven Queues When Customers Are Patient

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387967)