Analysis of two queues in parallel with jockeying and restricted capacities
From MaRDI portal
Publication:2472962
DOI10.1016/j.apm.2007.02.014zbMath1165.90409OpenAlexW2000789082MaRDI QIDQ2472962
Publication date: 25 February 2008
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2007.02.014
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (8)
A NEW LOOK ON THE SHORTEST QUEUE SYSTEM WITH JOCKEYING ⋮ Stationary analysis of the shortest queue problem ⋮ STRATEGIC DYNAMIC JOCKEYING BETWEEN TWO PARALLEL QUEUES ⋮ Analysis of job assignment with batch arrivals among heterogeneous servers ⋮ Switching queues, cultural conventions, and social welfare ⋮ Martingales and buffer overflow for the symmetric shortest queue model ⋮ Transient analysis of two queues in parallel with jockeying ⋮ A Queueing System with Two Parallel Lines, Cost-Conscious Customers, and Jockeying
Cites Work
- 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
- On the infinite server shortest queue problem: non-symmetric case
- TWO QUEUES IN PARALLEL
- Two Similar Queues in Parallel
- The autostrada queueing problem
- The shortest queue model with jockeying
- J.comput. appl. math
- Power Series for Stationary Distributions of Coupled Processor Models
- Analysis of the asymmetric shortest queue problem with threshold jockeying
- Two queues in parallel
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism
- The Power-Series Algorithm Applied to the Shortest-Queue Model
This page was built for publication: Analysis of two queues in parallel with jockeying and restricted capacities
