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

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

0.00 Avg rating0 Votes
Article ID: iaor1998455
Country: Netherlands
Volume: 74
Issue: 1
Start Page Number: 95
End Page Number: 110
Publication Date: Apr 1994
Journal: European Journal of Operational Research
Authors:
Keywords: queueing networks
Abstract:

Tandem queueing networks may be used as an alternative to simulation in evaluating the performance of proposed flow lines with finite work-in-process buffers. A new approximation is proposed for estimating the throughput rate and work-in-process inventory of finite-buffered exponential queues in series. The approximation is applied to several sets of previously published test problems and is shown to consistently perform well relative to existing models. In addition, a large simulation experiment is conducted to examine the robustness of the approximation under a wide range of parameter settings.

Reviews

Required fields are marked *. Your email address will not be published.