IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v37y1989i6p953-957.html
   My bibliography  Save this article

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

Author

Listed:
  • Ivo Adan

    (University of Technology, Eindhoven, The Netherlands)

  • Jan Van der Wal

    (University of Technology, Eindhoven, The Netherlands)

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.

Suggested Citation

  • Ivo Adan & Jan Van der Wal, 1989. "Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs," Operations Research, INFORMS, vol. 37(6), pages 953-957, December.
  • Handle: RePEc:inm:oropre:v:37:y:1989:i:6:p:953-957
    DOI: 10.1287/opre.37.6.953
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.37.6.953
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.37.6.953?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mark L. Spearman & Wallace J. Hopp, 2021. "The Case for a Unified Science of Operations," Production and Operations Management, Production and Operations Management Society, vol. 30(3), pages 802-814, March.
    2. van Dijk, Nico M., 1997. "An approximate solution and error bound for a discrete time queue with simultaneous servicing," European Journal of Operational Research, Elsevier, vol. 96(2), pages 289-298, January.
    3. Sonja Otten & Ruslan Krenzler & Lin Xie & Hans Daduna & Karsten Kruse, 2022. "Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 603-648, June.
    4. van Dijk, Nico M., 2008. "Error bounds for state space truncation of finite Jackson networks," European Journal of Operational Research, Elsevier, vol. 186(1), pages 164-181, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:37:y:1989:i:6:p:953-957. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.