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

Closed Finite Queuing Networks with Time Lags and with Several Classes of Units

Author

Listed:
  • M. Posner

    (University of Toronto, Toronto, Canada)

  • B. Bernholtz

    (University of Toronto, Toronto, Canada)

Abstract

The authors have previously investigated a broad class of closed, finite queuing networks with time lags, in which all units were considered to be identical. In this paper, that work is extended to the treatment of systems having several classes of units in which units belonging to different classes may have different sets of service parameters at the stations, different sets of travel-time distributions between stations, and different routing procedures through the system.

Suggested Citation

  • M. Posner & B. Bernholtz, 1968. "Closed Finite Queuing Networks with Time Lags and with Several Classes of Units," Operations Research, INFORMS, vol. 16(5), pages 977-985, October.
    • Handle: RePEc:inm:oropre:v:16:y:1968:i:5:p:977-985
    DOI: 10.1287/opre.16.5.977
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.16.5.977
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.16.5.977?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. Li, Shukai & Luo, Qi & Hampshire, Robert Cornelius, 2021. "Optimizing large on-demand transportation systems through stochastic conic programming," European Journal of Operational Research, Elsevier, vol. 295(2), pages 427-442.

    More about this item

    Statistics

    Access and download statistics

    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:16:y:1968:i:5:p:977-985. 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.