Matrix-geometric analysis of the shortest queue problem with threshold jockeying

DOI10.1016/0167-6377(93)90037-HzbMath0771.60071MaRDI QIDQ2367401

W. Henk M. Zijm, Ivo J. B. F. Adan, Jaap Wessels

Publication date: 10 August 1993

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

queuesmatrix-geometric approachparallel serversjockeyingshortest queues

Mathematics Subject Classification ID

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 ⋮ Some first passage time problems for the shortest queue model ⋮ STRATEGIC DYNAMIC JOCKEYING BETWEEN TWO PARALLEL QUEUES ⋮ COMPUTATION OF STEADY-STATE PROBABILITIES FOR RESOURCE-SHARING CALL-CENTER QUEUEING SYSTEMS ⋮ On the infinite server shortest queue problem: non-symmetric case ⋮ ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE ⋮ A Queueing System with Two Parallel Lines, Cost-Conscious Customers, and Jockeying ⋮ Upper and lower bounds for the waiting time in the symmetric shortest queue system

Cites Work

• Unnamed Item
• A matrix-geometric solution of the jockeying problem
• The shorter queue problem: A numerical study using the matrix-geometric solution
• General solutions of the jockeying problem
• A general class of Markov processes with explicit matrix-geometric solutions
• TWO QUEUES IN PARALLEL
• The shortest queue model with jockeying
• Analysis of the asymmetric shortest queue problem with threshold jockeying
• A solution for queues with instantaneous jockeying and other customer selection rules

This page was built for publication: Matrix-geometric analysis of the shortest queue problem with threshold jockeying