A decomposition approximation for finite-buffered flow lines of exponential queues

DOI10.1016/0377-2217(94)90207-0zbMath0803.90065OpenAlexW2016912177MaRDI QIDQ1330552

Mark C. Springer

Publication date: 3 January 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90207-0

zbMATH Keywords

simulationtandem queueing networksflow lineswork-in-process inventoryfinite work-in-process buffersfinite-buffered exponential queues

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Asymptotic behavior of the expansion method for open finite queueing networks
• Approximate analysis of exponential tandem queues with blocking
• On equivalencies of blocking mechanisms in queueing networks with blocking
• An approach to nonlinear programming
• An Approximation Method for Tandem Queues with Blocking
• An Approximation Method for Open Restricted Queueing Networks
• Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach

This page was built for publication: A decomposition approximation for finite-buffered flow lines of exponential queues