The M/M/c with critical jobs

DOI10.1007/BF01198401zbMath0941.90018MaRDI QIDQ1298763

Gerard Hooghiemstra, Ivo J. B. F. Adan

Publication date: 22 August 1999

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

matrix methodsboundspriority queue\(M/M/c\)

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

Analysis of job transfer policies in systems with unreliable servers

Cites Work

• Unnamed Item
• Unnamed Item
• A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results
• Simple bounds and monotonicity results for finite multi-server exponential tandem queues
• Monotonicity of the throughput of a closed exponential queueing network in the number of jobs
• Upper and lower bounds for the waiting time in the symmetric shortest queue system
• The symmetric longest queue system
• On the Assignment of Customers to Parallel Queues
• Simple bounds for queueing systems with breakdowns
• Simple Bounds for Finite Single-Server Exponential Tandem Queues
• A logarithmic reduction algorithm for quasi-birth-death processes