To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems
From MaRDI portal
Publication:5031669
DOI10.1287/opre.2019.1976zbMath1482.90072OpenAlexW3106669907MaRDI QIDQ5031669
Shuangchi He, Yunan Liu, Junfei Huang, Ping Cao
Publication date: 16 February 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2019.1976
customer abandonmentmany-server heavy-traffic limitpower-of-\(d\)join-the-shortest-queueoverloaded queuededicated queuejoin-idle-queues
Related Items (3)
The introduction of telemedicine service: with or without reimbursement? ⋮ Strategic shield against external shocks in a Markovian queue with vulnerable server ⋮ The double-space parking problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(G_{t}/GI/s_{t}+GI\) many-server fluid queue
- Asymptotic approximations for stationary distributions of many-server queues with abandonment
- Call centers with impatient customers: Many-server asymptotics of the M/M/\(n+G\) queue
- Join-the-shortest queue diffusion limit in Halfin-Whitt regime: tail asymptotics and scaling of extrema
- Heavy traffic limit theorems for a sequence of shortest queueing systems
- Many-server diffusion limits for \(G/Ph/n+GI\) queues
- Many-server Gaussian limits for overloaded non-Markovian queues with customer abandonment
- Many-server heavy-traffic limit for queues with time-varying parameters
- Pull-based load distribution in large-scale heterogeneous service systems
- On Pooling in Queueing Networks
- Asymptotic Optimality of Balanced Routing
- Universality of load balancing schemes on the diffusion scale
- Staffing to Maximize Profit for Call Centers with Alternate Service-Level Agreements
- Staffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Centers
- Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments
- Service-Level Agreements in Call Centers: Perils and Prescriptions
- Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime
- Diffusion Approximation for Efficiency-Driven Queues When Customers Are Patient
- Fluid Models for Multiserver Queues with Abandonments
- QUANTIFYING FAIRNESS IN QUEUING SYSTEMS
- Deciding Which Queue to Join: Some Counterexamples
- Heavy traffic limit theorems for a queueing system in which customers join the shortest line
- Resource Sharing for Efficiency in Traffic Systems
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Optimality of the shortest line discipline
- On the optimal assignment of customers to parallel servers
- A Basic Dynamic Routing Problem and Diffusion
- Refined Models for Efficiency-Driven Queues with Applications to Delay Announcements and Staffing
- On measuring fairness in queues
- Partitioning Customers into Service Groups
- Staffing to Stabilize the Tail Probability of Delay in Service Systems with Time-Varying Demand
- Pooling Queues with Strategic Servers: The Effects of Customer Ownership
- Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics
- The Power of Slightly More than One Sample in Randomized Load Balancing
This page was built for publication: To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems
