An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking

Stanley B. Gershwin
Additional contact information
Stanley B. Gershwin: Massachusetts Institute of Technology, Cambridge, Massachusetts

Operations Research, 1987, vol. 35, issue 2, 291-305

Abstract: This paper presents an efficient method for evaluating performance measures for a class of tandem queueing systems with finite buffers in which blocking and starvation are important. These systems are difficult to evaluate because they have large state spaces and because they cannot be decomposed exactly. The approximate decomposition approach we describe is based on system characteristics such as conservation of flow. Comparisons with exact and simulation results indicate that the approach is very accurate.

Keywords: 343 inventory levels and throughput in transfer lines; 570 Markov chain model of transfer lines; 683 decomposition approximation of queueing networks; 721 reliability and storage (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (40)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.2.291 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:35:y:1987:i:2:p:291-305

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().