Technical Note—Approximations for Overflows from Queues with a Finite Waiting Room

DOI10.1287/opre.27.6.1208zbMath0439.60093OpenAlexW2030836799MaRDI QIDQ3881697

Diane Sheng, John H. Rath

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1287/opre.27.6.1208

zbMATH Keywords

numerical comparisonsfinite waiting roomapproximations for overflows

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Related Items (4)

A stochastic recirculation system with random access ⋮ Nonstationary queues with interrupted Poisson arrivals and unreliable/repairable servers ⋮ Properties of the interrupted Poisson approximation ⋮ On a two-server finite queueing system with ordered entry and deterministic arrivals

This page was built for publication: Technical Note—Approximations for Overflows from Queues with a Finite Waiting Room