Simple Bounds for Finite Single-Server Exponential Tandem Queues

Nico M. Van Dijk and Bernard F. Lamond
Additional contact information
Nico M. Van Dijk: Vrije Universiteit, Amsterdam, The Netherlands
Bernard F. Lamond: University of Arizona, Tucson, Arizona

Operations Research, 1988, vol. 36, issue 3, 470-477

Abstract: Tandem queue configurations naturally arise in multistage stochastic systems such as assembly lines in manufacturing or multiphase transmissions in telecommunications. As finite capacity or storage constraints (buffers) are usually involved, the celebrated closed product form expression is generally not applicable. In this paper, a new bounding methodology for nonproduct form systems is applied to finite single-server exponential tandem queues. The methodology is based on modifying the original system into product form systems that provide bounds for some performance measure of interest. The product form modifications given for this finite tandem queue propose a computationally attractive and intuitively obvious lower and upper bound for the call congestion and throughput. Numerical results indicate that the bounds are reasonable indicators of the order of magnitude. This can be useful for quick engineering purposes as will be illustrated by an optimal design example. A formal proof of the bounds is given. This proof extends standard techniques for comparing stochastic systems and is of interest in itself.

Keywords: queues; tandem: finite single server; networks/graphs; stochastic: tandem queues (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.36.3.470 (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:36:y:1988:i:3:p:470-477

Access Statistics for this article

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