A level-crossing approach to the solution of the shortest-queue problem

DOI10.1016/S0167-6377(97)00041-2zbMath0892.90086WikidataQ127172473 ScholiaQ127172473MaRDI QIDQ1382808

D. Massart

Publication date: 18 March 1998

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

zbMATH Keywords

waiting timequeue lengthtwo-dimensional extensionlevel-crossing approachmany server caseshortest-queue

Mathematics Subject Classification ID

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

Related Items (4)

Bad luck when joining the shortest queue ⋮ Some first passage time problems for the shortest queue model ⋮ On the infinite server shortest queue problem: non-symmetric case ⋮ ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE

Cites Work

• Unnamed Item
• Unnamed Item
• The shorter queue problem: A numerical study using the matrix-geometric solution
• A numerically stable algorithm for two server queue models
• Analysis of the asymmetric shortest queue problem
• TWO QUEUES IN PARALLEL
• Two Similar Queues in Parallel
• The autostrada queueing problem
• The shortest queue problem
• A note on waiting times in systems with queues in parallel
• Poisson Arrivals See Time Averages
• The System Point Method in Exponential Queues: A Level Crossing Approach
• Two queues in parallel
• Level Crossings in Point Processes Applied to Queues: Single-Server Case
• A Basic Dynamic Routing Problem and Diffusion
• On Jockeying in Queues
• The Power-Series Algorithm Applied to the Shortest-Queue Model

This page was built for publication: A level-crossing approach to the solution of the shortest-queue problem