Delay-join the shortest queue routing for a parallel queueing system with removable servers
From MaRDI portal
Publication:5046015
DOI10.1287/STSY.2021.0090zbMATH Open1498.60356OpenAlexW4210880993MaRDI QIDQ5046015FDOQ5046015
Authors: Pamela Badian-Pessot, Douglas G. Down, Mark E. Lewis 
Publication date: 8 November 2022
Published in: Stochastic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/stsy.2021.0090
Recommendations
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- Stability of parallel server systems
- Replicate to the shortest queues
- Two parallel queues with infinite servers and \textit{join the shortest queue} discipline
- Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
Cites Work
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- Stochastic-Process Limits
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Fluid approximations and stability of multiclass queueing networks: Work-conserving disciplines
- Title not available (Why is that?)
- Queueing models of call centers: An introduction
- On the optimal assignment of customers to parallel servers
- Optimality of the shortest line discipline
- Stability and convergence of moments for multiclass queueing networks via fluid limit models
- Title not available (Why is that?)
- On the stability of a partially accessible multi-station queue with state-dependent routing
- OPTIMAL ROUTING IN OUTPUT-QUEUED FLEXIBLE SERVER SYSTEMS
- Optimal control policies for an \(M/M/1\) queue with a removable server and dynamic service rates
Cited In (7)
- Stability of parallel server systems
- Improving routing decisions in parallel non-observable queues
- Approximating the mean response time of parallel queues with JSQ policy
- Replicate to the shortest queues
- Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing
- Heavy traffic limits for join-the-shortest-estimated-queue policy using delayed information
- Comparing load balancing algorithms for distributed queueing networks
This page was built for publication: Delay-join the shortest queue routing for a parallel queueing system with removable servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5046015)
