A heurisic technique for the transient behavior of Markovian queueing systems

DOI10.1016/0167-6377(85)90005-7zbMath0573.90038OpenAlexW2027943689MaRDI QIDQ1062899

Emily Roth

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90005-7

zbMATH Keywords

approximationsheuristicnumerical solutionsMarkovian queueing systemstransient resultsexpected queue length

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (1)

Computing transient performance measures for the \(M/M/1\) queue

Cites Work

• An Empirical Investigation of the Transient Behavior of Stationary Queueing Systems
• A Closure Approximation for the Nonstationary M/M/s Queue
• Approximating the Behavior of Nonstationary Single-Server Queues

This page was built for publication: A heurisic technique for the transient behavior of Markovian queueing systems