IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-00484446.html
   My bibliography  Save this paper

Asymptotic behavior of the expansion method for open finite queueing networks

Author

Listed:
  • Laoucine Kerbache

    (UMass Amherst - University of Massachusetts [Amherst] - UMASS - University of Massachusetts System)

  • J. Macgregor Smith

Abstract

In previous papers, we have reported on the use of the expansion method for estimating sojourn times in finite network topologies. In this paper, we focus on comparing the expansion method with P. C. Bell's consistency conditions where subject to unbalanced service rates at tandem queues, other decomposition approaches yield impossible throughput results. We compare numerical results of the expansion method with the other approaches in light of these conditions.

Suggested Citation

  • Laoucine Kerbache & J. Macgregor Smith, 1988. "Asymptotic behavior of the expansion method for open finite queueing networks," Post-Print hal-00484446, HAL.
    • Handle: RePEc:hal:journl:hal-00484446
    DOI: 10.1016/0305-0548(88)90008-1
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Jean-Sébastien Tancrez, 2020. "A decomposition method for assembly/disassembly systems with blocking and general distributions," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 272-296, June.
    2. H. S. R. Martins & F. R. B. Cruz & A. R. Duarte & F. L. P. Oliveira, 2019. "Modeling and optimization of buffers and servers in finite queueing networks," OPSEARCH, Springer;Operational Research Society of India, vol. 56(1), pages 123-150, March.
    3. Noa Zychlinski & Avishai Mandelbaum & Petar Momčilović & Izack Cohen, 2020. "Bed Blocking in Hospitals Due to Scarce Capacity in Geriatric Institutions—Cost Minimization via Fluid Models," Manufacturing & Service Operations Management, INFORMS, vol. 22(2), pages 396-411, March.
    4. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    5. Cruz, F.R.B. & Van Woensel, T. & Smith, J. MacGregor, 2010. "Buffer and throughput trade-offs in M/G/1/K queueing networks: A bi-criteria approach," International Journal of Production Economics, Elsevier, vol. 125(2), pages 224-234, June.
    6. Osorio, Carolina & Wang, Carter, 2017. "On the analytical approximation of joint aggregate queue-length distributions for traffic networks: A stationary finite capacity Markovian network approach," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 305-339.
    7. Osorio, Carolina & Bierlaire, Michel, 2009. "An analytic finite capacity queueing network model capturing the propagation of congestion and blocking," European Journal of Operational Research, Elsevier, vol. 196(3), pages 996-1007, August.
    8. Bakuli, David L. & MacGregor Smith, J., 1996. "Resource allocation in state-dependent emergency evacuation networks," European Journal of Operational Research, Elsevier, vol. 89(3), pages 543-555, March.
    9. Kavusturucu, Ayse & Gupta, Surendra M., 1999. "Manufacturing systems with machine vacations, arbitrary topology and finite buffers," International Journal of Production Economics, Elsevier, vol. 58(1), pages 1-15, January.
    10. Smith, J. MacGregor & Cruz, F.R.B. & van Woensel, T., 2010. "Topological network design of general, finite, multi-server queueing networks," European Journal of Operational Research, Elsevier, vol. 201(2), pages 427-441, March.

    More about this item

    Keywords

    Queue; Network; Queueing system;
    All these keywords.

    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:hal:journl:hal-00484446. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.