The shortest queue problem

DOI10.2307/3213954MaRDI QIDQ3738364zbMATH OpenOpenAlexFDO

Authors 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 programmingqueues in parallelstationary statetail probabilities

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• Join the shortest queue among \(k\) parallel queues: tail asymptotics of its stationary distribution
• J.comput. appl. math
• ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
• scientific article; zbMATH DE number 4066100
• Minimizing response times and queue lengths in systems of parallel queues

Cited in

(41)

• Optimality of routing and servicing in dependent parallel processing systems
• Upper and lower bounds for the waiting time in the symmetric shortest queue system
• Shortest expected delay routing for Erlang servers
• A level-crossing approach to the solution of the shortest-queue problem
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• 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
• Replicate to the shortest queues
• 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
• The shorter queue polling model
• The autostrada queueing problem
• On the optimality of the shortest line discipline
• Steady-state analysis of the join-the-shortest-queue model in the Halfin-Whitt regime
• On the Optimality of the Generalized Shortest Queue Policy
• On the Shortest Queue Policy for the Tandem Parallel Queue
• The shortest queue model with jockeying
• scientific article; zbMATH DE number 4066100 (Why is no real title available?)
• scientific article; zbMATH DE number 1031395 (Why is no real title available?)
• Analysis of job assignment with batch arrivals among heterogeneous servers
• scientific article; zbMATH DE number 1936537 (Why is no real title available?)
• ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
• scientific article; zbMATH DE number 836619 (Why is no real title available?)
• scientific article; zbMATH DE number 934476 (Why is no real title available?)
• 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
• Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism
• 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
• The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times
• A numerically stable algorithm for two server queue models
• The minimum backlog problem

This page was built for publication: The shortest queue problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738364)