Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs

Ivo Adan and Jan Van der Wal
Additional contact information
Ivo Adan: University of Technology, Eindhoven, The Netherlands
Jan Van der Wal: University of Technology, Eindhoven, The Netherlands

Operations Research, 1989, vol. 37, issue 6, 953-957

Abstract: Using a sample path argument, it is shown that the throughput of a closed queueing network with general service times is nondecreasing in the number of jobs.

Keywords: queues; networks: monotonicity of the throughput (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.6.953 (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:37:y:1989:i:6:p:953-957

Access Statistics for this article

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