A two-queue, one-server model with priority for the longer queue
From MaRDI portal
Publication:1109435
DOI10.1007/BF01158902zbMath0655.60090MaRDI QIDQ1109435
Publication date: 1987
Published in: Queueing Systems (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (18)
On a numerical method for calculating state probabilities for queueing systems with more than one waiting line ⋮ The Tail Behavior of a Longest-Queue-Served-First Queueing System: A Random Walk in the Half Plane ⋮ Boundary value problems in queueing theory ⋮ Quasi-Birth-and-Death Processes, Lattice Path Counting, and Hypergeometric Functions ⋮ A 3-queue polling system with join the shortest-serve the longest policy ⋮ A TWO-CLASS RETRIAL SYSTEM WITH COUPLED ORBIT QUEUES ⋮ Queue-length balance equations in multiclass multiserver queues and their generalizations ⋮ Repair systems with exchangeable items and the longest queue mechanism ⋮ On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits ⋮ Stationary analysis of the shortest queue first service policy ⋮ Optimality of routing and servicing in dependent parallel processing systems ⋮ Performance evaluation of polling systems by means of the power-series algorithm ⋮ Martingales and buffer overflow for the symmetric shortest queue model ⋮ 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 ⋮ Stationary analysis of the “Shortest Queue First” service policy: The asymmetric case ⋮ A STATE-DEPENDENT POLLING MODEL WITH k-LIMITED SERVICE ⋮ The Longer Queue Model ⋮ A polling system with `join the shortest -- serve the longest' policy
Cites Work
This page was built for publication: A two-queue, one-server model with priority for the longer queue
