A decomposition approximation for finite-buffered flow lines of exponential queues
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3878642
- An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
- Performance evaluation of closed tandem queueing networks with finite buffers
- An efficient two-phase approximation method for exponential tandem queueing systems with blocking
- An approximate analysis of open tandem queueing networks with blocking and general service times
Cites work
- An approach to nonlinear programming
- An Approximation Method for Open Restricted Queueing Networks
- An Approximation Method for Tandem Queues with Blocking
- Approximate analysis of exponential tandem queues with blocking
- Asymptotic behavior of the expansion method for open finite queueing networks
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
- scientific article; zbMATH DE number 2172949 (Why is no real title available?)
- On equivalencies of blocking mechanisms in queueing networks with blocking
Cited in
(4)- A decomposition approximation for assembly-disassembly queueing networks with finite buffer and blocking
- Point and interval estimation of decomposition error in discrete-time open tandem queues
- A statistical approximation for queueing measures in a decision support system
- Tandem Queues with Planned Inventories
This page was built for publication: A decomposition approximation for finite-buffered flow lines of exponential queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330552)
