The M/M/c with critical jobs
type: Item
instance of: scholarly article
title: The M/M/c with critical jobs
zbMATH Open document ID: 0941.90018
DOI: 10.1007/BF01198401
author: Gerard Hooghiemstra
author: Ivo Adan
published in: Mathematical Methods of Operations Research
publication date: 1999-08-22T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 1326515
zbMATH Keywords: \(M/M/c\)
zbMATH Keywords: priority queue
zbMATH Keywords: bounds
zbMATH Keywords: matrix methods
MaRDI profile type: Publication
cites work: Upper and lower bounds for the waiting time in the symmetric shortest queue system
cites work: The symmetric longest queue system
cites work: Q5560061
cites work: Simple bounds for queueing systems with breakdowns
cites work: A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results
cites work: Simple Bounds for Finite Single-Server Exponential Tandem Queues
cites work: Simple bounds and monotonicity results for finite multi-server exponential tandem queues
cites work: On the Assignment of Customers to Parallel Queues
cites work: A logarithmic reduction algorithm for quasi-birth-death processes
cites work: Q3923308
cites work: Monotonicity of the throughput of a closed exponential queueing network in the number of jobs
description: scientific article; zbMATH DE number 1326515