Bad luck when joining the shortest queue

DOI10.1016/j.ejor.2008.01.037zbMath1159.90338OpenAlexW2154724896MaRDI QIDQ2378388

J. P. C. Blanc

Publication date: 8 January 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.01.037

zbMATH Keywords

queueingpower-series algorithmjoin-the-shortest-queuededicated customersovertaking customersprobability of bad luck

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items

The shorter queue polling model ⋮ Steady-state analysis of shortest expected delay routing ⋮ A 3-queue polling system with join the shortest-serve the longest policy ⋮ Optimal routing for electric vehicle charging systems with stochastic demand: a heavy traffic approximation approach ⋮ A polling system with `join the shortest -- serve the longest' policy ⋮ Random queues and risk averse users

Cites Work

• Unnamed Item
• On a numerical method for calculating state probabilities for queueing systems with more than one waiting line
• Optimality of the shortest line discipline with state-dependent service rates
• 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
• TWO QUEUES IN PARALLEL
• The autostrada queueing problem
• On the Optimality of the Generalized Shortest Queue Policy
• The shortest queue model with jockeying
• J.comput. appl. math
• The shortest queue problem
• A note on waiting times in systems with queues in parallel
• Heavy traffic limit theorems for a queueing system in which customers join the shortest line
• Two queues in parallel
• Optimality of the shortest line discipline
• The Power-Series Algorithm Applied to the Shortest-Queue Model

This page was built for publication: Bad luck when joining the shortest queue