Transient analysis of two queues in parallel with jockeying
From MaRDI portal
Publication:3630055
DOI10.1080/17442500802200658zbMath1165.60346OpenAlexW2052745797MaRDI QIDQ3630055
Publication date: 2 June 2009
Published in: Stochastics (Search for Journal in Brave)
Full work available at URL: http://www.informaworld.com/smpp/./content~db=all~content=a910733750
randomizationRunge-Kutta methodmatrix analytic methodsingle server queuejockeyingtransient-state solution
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of branching processes (60J85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of the asymmetrical shortest two-server queueing model
- Upper and lower bounds for the waiting time in the symmetric shortest queue system
- Analysis of two queues in parallel with jockeying and restricted capacities
- On the infinite server shortest queue problem: non-symmetric case
- TWO QUEUES IN PARALLEL
- Two Similar Queues in Parallel
- The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes
- The autostrada queueing problem
- The shortest queue model with jockeying
- J.comput. appl. math
- Analysis of the asymmetric shortest queue problem with threshold jockeying
- Two queues in parallel
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- Queueing Analysis of a Jockeying Model
- Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism
This page was built for publication: Transient analysis of two queues in parallel with jockeying