IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v25y1979i10p1027-1034.html
   My bibliography  Save this article

Note--Some Results on Sojourn Times in Acyclic Jackson Networks

Author

Listed:
  • B. Simon

    (Bell Laboratories, Holmdel, New Jersey)

  • R. D. Foley

    (Virginia Polytechnic Institute and State University)

Abstract

Lemoine (Lemoine, A. 1977. Networks of queues--a survey of equilibrium analysis. Management Sci. 24 464-481.) studies sojourn times in acyclic, Jackson networks as part of his survey of equilibrium results. In his paper, he argues that a particular customer has a sojourn time at node i that is independent of his remaining sojourn time in the network given that the customer transfer from node i to node j. This assumption is then used to derive a set of equations involving the Laplace-Stieltjes transform of the sojourn times at each node from which several properties of sojourn times are determined. In a private communication, Mitrani (Mitrani, I. 1978. A critical note on a result of Lemoine. Private communication.) argues that the independence assumption is in error and provides a heuristic argument based on a four node, acyclic, Jackson network. From this, Mitrani concludes that the sojourn time in such networks is still an unsolved problem. We make Mitrani's argument rigorous, using some new results on sojourn times in Jackson networks.

Suggested Citation

  • B. Simon & R. D. Foley, 1979. "Note--Some Results on Sojourn Times in Acyclic Jackson Networks," Management Science, INFORMS, vol. 25(10), pages 1027-1034, October.
    • Handle: RePEc:inm:ormnsc:v:25:y:1979:i:10:p:1027-1034
    DOI: 10.1287/mnsc.25.10.1027
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.25.10.1027
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.25.10.1027?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. Hum, Sin-Hoon & Parlar, Mahmut & Zhou, Yun, 2018. "Measurement and optimization of responsiveness in supply chain networks with queueing structures," European Journal of Operational Research, Elsevier, vol. 264(1), pages 106-118.
    2. Hoogwerf, J., 1982. "Sojourn time distribution in data networks with independent exponential services times," Serie Research Memoranda 0024, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.

    More about this item

    Keywords

    networks of queues;

    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:ormnsc:v:25:y:1979:i:10:p:1027-1034. 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.