A two-queue, one-server model with priority for the longer queue
From MaRDI portal
DOI10.1007/BF01158902zbMATH Open0655.60090MaRDI QIDQ1109435FDOQ1109435
Authors: J. W. Cohen
Publication date: 1987
Published in: Queueing Systems (Search for Journal in Brave)
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
Cited In (27)
- A 3-queue polling system with join the shortest-serve the longest policy
- A STATE-DEPENDENT POLLING MODEL WITH k-LIMITED SERVICE
- The tail behavior of a longest-queue-served-first queueing system: a random walk in the half plane
- A polling system with `join the shortest -- serve the longest' policy
- Title not available (Why is that?)
- Title not available (Why is that?)
- On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency
- Boundary value problems in queueing theory
- General analysis of Poisson queuing models with double processing of calls in a single server
- Quasi-Birth-and-Death Processes, Lattice Path Counting, and Hypergeometric Functions
- On the nonsymmetric longer queue model. II: Marginal and conditional probabilities
- On a numerical method for calculating state probabilities for queueing systems with more than one waiting line
- A two-class retrial system with coupled orbit queues
- Queue-length balance equations in multiclass multiserver queues and their generalizations
- A two-stage model queueing with no waiting line between channels
- Stationary analysis of the shortest queue first service policy
- Analysis of a dynamic priority queue
- Martingales and buffer overflow for the symmetric shortest queue model
- Title not available (Why is that?)
- The Longer Queue Model
- Optimality of routing and servicing in dependent parallel processing systems
- Title not available (Why is that?)
- On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits
- Performance evaluation of polling systems by means of the power-series algorithm
- The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times
- Stationary analysis of the ``shortest queue first service policy: the asymmetric case
- Repair systems with exchangeable items and the longest queue mechanism
This page was built for publication: A two-queue, one-server model with priority for the longer queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109435)