Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks

J. George Shanthikumar and David D. Yao
Additional contact information
J. George Shanthikumar: University of California, Berkeley, California
David D. Yao: Harvard University, Cambridge, Massachusetts

Operations Research, 1987, vol. 35, issue 4, 583-588

Abstract: We study a Gordon-Newell type of closed queueing network that frequently arises in modeling manufacturing and computer systems. We are concerned with the transient and equilibrium behavior of the joint and individual queue lengths in the network when the job population increases. We show that increasing the job population will stochastically increase the queue-length vector process, provided that all stations have nondecreasing service rates. Single and multivariate likelihood ratio orderings are also established for the joint queue lengths in equilibrium. Our results extend the applicability of previously known results in the literature.

Keywords: 697 closed queueing network; 706 stochastic monotonicity (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.4.583 (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:4:p:583-588

Access Statistics for this article

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