An M/G/c queue in which the number of servers required is random

DOI10.2307/3213620zbMath0557.60081OpenAlexW2324580940WikidataQ101200036 ScholiaQ101200036MaRDI QIDQ3221163

Linda V. Green, Awi Federgruen

Publication date: 1984

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3213620

zbMATH Keywords

queueing systemPoisson arrivalapproximations for the steady-state probabilities

Mathematics Subject Classification ID

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

Related Items (6)

Blocking of finite source inputs which require simultaneous servers with general think and holding times ⋮ Computation and optimization methods for multiresource queues ⋮ Stability criterion of a multiserver model with simultaneous service ⋮ Stability conditions for a multiserver queueing system with a regenerative input flow and simultaneous service of a customer by a random number of servers ⋮ The double-space parking problem ⋮ A queueing system where customers require a random number of servers simultaneously

This page was built for publication: An M/G/c queue in which the number of servers required is random