The shortest queue problem
From MaRDI portal
Publication:3738364
DOI10.2307/3213954zbMath0602.60080OpenAlexW2316819262MaRDI QIDQ3738364
Publication date: 1985
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3213954
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (26)
Bad luck when joining the shortest queue ⋮ Analysis of the asymmetric shortest queue problem ⋮ The shorter queue polling model ⋮ Performance modeling of a two-echelon supply chain under different levels of upstream inventory information sharing ⋮ Approximating the mean response time of parallel queues with JSQ policy ⋮ A level-crossing approach to the solution of the shortest-queue problem ⋮ Stationary analysis of the shortest queue problem ⋮ Steady-state analysis of shortest expected delay routing ⋮ Some first passage time problems for the shortest queue model ⋮ A 3-queue polling system with join the shortest-serve the longest policy ⋮ Cost-aware defense for parallel server systems against reliability and security failures ⋮ Analysis of job assignment with batch arrivals among heterogeneous servers ⋮ Optimality of routing and servicing in dependent parallel processing systems ⋮ Web server load balancing: a queueing analysis ⋮ COMPUTATION OF STEADY-STATE PROBABILITIES FOR RESOURCE-SHARING CALL-CENTER QUEUEING SYSTEMS ⋮ On the infinite server shortest queue problem: non-symmetric case ⋮ ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE ⋮ Performance Analysis of Joining the Shortest Queue Model Among a Large Number of Queues ⋮ Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling ⋮ Martingales and buffer overflow for the symmetric shortest queue model ⋮ Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics ⋮ Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime ⋮ On the Shortest Queue Policy for the Tandem Parallel Queue ⋮ A polling system with `join the shortest -- serve the longest' policy ⋮ A numerically stable algorithm for two server queue models ⋮ Upper and lower bounds for the waiting time in the symmetric shortest queue system
This page was built for publication: The shortest queue problem
