Approximating the Behavior of Nonstationary Single-Server Queues

DOI10.1287/OPRE.23.5.1011MaRDI QIDQ4069601zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(6)

• 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 transient behaviour of the \(M/E_ k/2\) queue and steady-state simulation
• A heurisic technique for the transient behavior of Markovian queueing systems
• Effects of fluctuations in the quantity of work arriving on waiting time, idle time and rate of losing customers
• The single server queue with inhomogeneous arrival rate and discrete service time distribution

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4069601)