Approximating the Behavior of Nonstationary Single-Server Queues

DOI10.1287/opre.23.5.1011zbMath0311.60060OpenAlexW2098497479MaRDI QIDQ4069601

S. C. Moore

Publication date: 1975

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

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

Mathematics Subject Classification ID

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

Related Items (6)

Effects of fluctuations in the quantity of work arriving on waiting time, idle time and rate of losing customers ⋮ The transient behaviour of the \(M/E_ k/2\) queue and steady-state simulation ⋮ Approximating queue lengths in \(M(t)/G/1\) queue using the maximum entropy principle ⋮ Robust transient analysis of multi-server queueing systems and feed-forward networks ⋮ The single server queue with inhomogeneous arrival rate and discrete service time distribution ⋮ A heurisic technique for the transient behavior of Markovian queueing systems

This page was built for publication: Approximating the Behavior of Nonstationary Single-Server Queues