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

DOI10.1016/0377-2217(94)90207-0MaRDI QIDQ1330552zbMATH OpenOpenAlexFDO

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

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

• scientific article; zbMATH DE number 2172949 (Why is no real title available?)
• An Approximation Method for Open Restricted Queueing Networks
• An Approximation Method for Tandem Queues with Blocking
• An approach to nonlinear programming
• 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
• On equivalencies of blocking mechanisms in queueing networks with blocking

Cited in

(1)

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