The shortest queue problem

DOI10.2307/3213954zbMath0602.60080MaRDI QIDQ3738364

Shlomo Halfin

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

zbMATH Keywords

linear programming; tail probabilities; stationary state; queues in parallel

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

Related Items

ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE, Performance Analysis of Joining the Shortest Queue Model Among a Large Number of Queues, Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics, The shorter queue polling model, Analysis of job assignment with batch arrivals among heterogeneous servers, A numerically stable algorithm for two server queue models, Optimality of routing and servicing in dependent parallel processing systems, Upper and lower bounds for the waiting time in the symmetric shortest queue system, A level-crossing approach to the solution of the shortest-queue problem, Performance modeling of a two-echelon supply chain under different levels of upstream inventory information sharing, Stationary analysis of the shortest queue problem, Steady-state analysis of shortest expected delay routing, Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling, Approximating the mean response time of parallel queues with JSQ policy, Martingales and buffer overflow for the symmetric shortest queue model, A polling system with `join the shortest -- serve the longest' policy, Bad luck when joining the shortest queue, Some first passage time problems for the shortest queue model, Web server load balancing: a queueing analysis, On the infinite server shortest queue problem: non-symmetric case, Analysis of the asymmetric shortest queue problem, COMPUTATION OF STEADY-STATE PROBABILITIES FOR RESOURCE-SHARING CALL-CENTER QUEUEING SYSTEMS, 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