Matrix-geometric analysis of the shortest queue problem with threshold jockeying
From MaRDI portal
Recommendations
Cites work
- A general class of Markov processes with explicit matrix-geometric solutions
- A matrix-geometric solution of the jockeying problem
- A solution for queues with instantaneous jockeying and other customer selection rules
- Analysis of the asymmetric shortest queue problem with threshold jockeying
- General solutions of the jockeying problem
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- The shorter queue problem: A numerical study using the matrix-geometric solution
- The shortest queue model with jockeying
- TWO QUEUES IN PARALLEL
Cited in
(13)- Upper and lower bounds for the waiting time in the symmetric shortest queue system
- Some first passage time problems for the shortest queue model
- On the infinite server shortest queue problem: non-symmetric case
- COMPUTATION OF STEADY-STATE PROBABILITIES FOR RESOURCE-SHARING CALL-CENTER QUEUEING SYSTEMS
- scientific article; zbMATH DE number 7344198 (Why is no real title available?)
- A Queueing System with Two Parallel Lines, Cost-Conscious Customers, and Jockeying
- scientific article; zbMATH DE number 3947971 (Why is no real title available?)
- Analysis of the asymmetric shortest queue problem with threshold jockeying
- ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
- Applications of matrix-geometric solutions for queueing performance evaluation of a hybrid switching system
- A new look on the shortest queue system with jockeying
- STRATEGIC DYNAMIC JOCKEYING BETWEEN TWO PARALLEL QUEUES
- A matrix-geometric solution of the jockeying problem
This page was built for publication: Matrix-geometric analysis of the shortest queue problem with threshold jockeying
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367401)