A relaxation time heuristic for exponential-Erlang queueing systems
From MaRDI portal
Publication:2367050
Recommendations
- scientific article; zbMATH DE number 3962933
- A heurisic technique for the transient behavior of Markovian queueing systems
- A heuristic for the transient expected queue length of Markovian queueing systems
- Approximate solution for multi-server queueing systems with Erlangian service times
- ON THE RELAXATION TIME FOR SINGLE SERVER QUEUES
Cites work
- A new approach for dealing with the startup problem in discrete event simulation
- An Empirical Investigation of the Transient Behavior of Stationary Queueing Systems
- Evaluation of commonly used rules for detecting “steady state” in computer simulation
- Evaluation of startup policies in simulation experiments
- scientific article; zbMATH DE number 3770836 (Why is no real title available?)
- scientific article; zbMATH DE number 3488392 (Why is no real title available?)
- Simulation methodology - an introduction for queueing theorists
- The Transient Behavior of the M/M/s Queue, with Implications for Steady-State Simulation
- The transient behaviour of the \(M/E_ k/2\) queue and steady-state simulation
- Transient behavior of the M/M/1 queue: Starting at the origin
Cited in
(4)
This page was built for publication: A relaxation time heuristic for exponential-Erlang queueing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367050)