The shorter queue problem: A numerical study using the matrix-geometric solution
DOI10.1016/0377-2217(84)90106-1zbMATH Open0546.90036OpenAlexW2087643035MaRDI QIDQ798559FDOQ798559
Authors: Ilya Gertsbakh
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90106-1
Recommendations
- Matrix-geometric solution of a multiserver queue with Markovian group arrivals and Coxian servers
- Upper and lower bounds for the waiting time in the symmetric shortest queue system
- An M/M/1 queue with a general bulk service rule
- scientific article; zbMATH DE number 1535812
- Semi-explicit solutions for M/PH/1-like queueing systems
- Analyses of an M/M/N queue with servers' vacations
- A Queueing System with Auxiliary Servers
- Perturbation analysis of a phase-type queue with weakly correlated arrivals
stationary distributionsnumerical studyaverage waiting timesmatrix-geometric solution techniqueshorter queue systemtwo queues
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
Cited In (21)
- A level-crossing approach to the solution of the shortest-queue problem
- Analysis of the asymmetric shortest queue problem
- STRATEGIC DYNAMIC JOCKEYING BETWEEN TWO PARALLEL QUEUES
- A Queueing System with Two Parallel Lines, Cost-Conscious Customers, and Jockeying
- Applications of matrix-geometric solutions for queueing performance evaluation of a hybrid switching system
- Title not available (Why is that?)
- Title not available (Why is that?)
- ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
- GEOMETRIC DECAY OF THE STEADY-STATE PROBABILITIES IN A QUASI-BIRTH-AND-DEATH PROCESS WITH A COUNTABLE NUMBER OF PHASES
- Approximating the mean response time of parallel queues with JSQ policy
- On a numerical method for calculating state probabilities for queueing systems with more than one waiting line
- A new look on the shortest queue system with jockeying
- Matrix geometric approach for random walks: stability condition and equilibrium distribution
- Martingales and buffer overflow for the symmetric shortest queue model
- Matrix-geometric analysis of the shortest queue problem with threshold jockeying
- The generalized join the shortest orbit queue system: stability, exact tail asymptotics and stationary approximations
- The unobserved waiting customer approximation
- Analysis of the shortest relay queue policy in a cooperative random access network with collisions
- A numerically stable algorithm for two server queue models
- Upper and lower bounds for the waiting time in the symmetric shortest queue system
- Some first passage time problems for the shortest queue model
This page was built for publication: The shorter queue problem: A numerical study using the matrix-geometric solution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798559)