Observing general service queues before joining

DOI10.1016/0167-6377(95)00056-9zbMath0855.90063OpenAlexW2046057849MaRDI QIDQ1919196

David A. Stanford, Myron Hlynka

Publication date: 3 February 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(95)00056-9

zbMATH Keywords

hyperexponential distributionparallel queuesjoin the shortest queuejoining strategies

Mathematics Subject Classification ID

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

Related Items (2)

An exponential queue with competition for service ⋮ A note on joining strategies for two queues in parallel

Cites Work

• Unnamed Item
• A matrix-geometric solution of the jockeying problem
• Analysis of the asymmetric shortest queue problem
• TWO QUEUES IN PARALLEL
• Two Similar Queues in Parallel
• Characterising interdeparture times for bursty input streams in the queue with pooled renewal arrivals
• The shortest queue model with jockeying
• Observing Queues Before Joining

This page was built for publication: Observing general service queues before joining