A level-crossing approach to the solution of the shortest-queue problem
From MaRDI portal
Publication:1382808
DOI10.1016/S0167-6377(97)00041-2zbMath0892.90086MaRDI QIDQ1382808
Publication date: 18 March 1998
Published in: Operations Research Letters (Search for Journal in Brave)
waiting time; queue length; two-dimensional extension; level-crossing approach; many server case; shortest-queue
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
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