A Variable Buffer-Size Model and Its Use in Analyzing Closed Queueing Networks with Blocking

Rajan Suri and Gregory W. Diehl
Additional contact information
Rajan Suri: Division of Applied Sciences, Harvard University, Cambridge, Massachusetts 02138
Gregory W. Diehl: Division of Applied Sciences, Harvard University, Cambridge, Massachusetts 02138

Management Science, 1986, vol. 32, issue 2, 206-224

Abstract: We present a model which enables efficient analysis of certain types of closed queueing networks with blocking due to limited buffer spaces. The networks analyzed are those in which the limited buffers occur in tandem subnetworks. A new model, with variable buffer-size, is introduced as a conceptual tool to model part of a tandem network with blocking, using only product-form submodels. Using this model we iteratively solve for the whole network. The technique is illustrated first for a simple system with tandem queues, and then for more complex systems. The method is compared with exact solutions or simulations, and found to be reasonably accurate. The method is easily implemented using standard software for closed queueing networks. Given the complexity of the blocking problem, our approach offers a simple and efficient alternative to exact analysis.

Keywords: queues: networks; queues: approximations; production/scheduling: flexible manufacturing (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.32.2.206 (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:ormnsc:v:32:y:1986:i:2:p:206-224

Access Statistics for this article

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