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

Closed Queuing Systems with Exponential Servers

Author

Listed:
  • William J. Gordon

    (General Motors Research Laboratories, Warren, Michigan)

  • Gordon F. Newell

    (University of California, Richmond, California)

Abstract

The results contained herein pertain to the problem of determining the equilibrium distribution of customers in closed queuing systems composed of M interconnected stages of service. The number of customers, N , in a closed queuing system is fixed since customers pass repeatedly through the M stages with neither entrances nor exits permitted. At the i th stage there are r i parallel exponential servers all of which have the same mean service rate μ i . When service is completed at stage i , a customer proceeds directly to stage j with probability p ıj . Such closed systems are shown to be stochastically equivalent to open systems in which the number of customers cannot exceed N . The equilibrium equations for the joint probability distribution of customers are solved by a separation of variables technique. In the limit of N → ∞ it is found that the distribution of customers in the system is regulated by the stage (or stages) with the slowest effective service rate. Asymptotic expressions are given for the marginal distributions of customers in such systems. Then, an asymptotic analysis is carried out for systems with a large number of stages (i.e., M ≫ 1) all of which have comparable effective service rates. Approximate expressions are obtained for the marginal probability distributions. The details of the analysis are illustrated by an example.

Suggested Citation

  • William J. Gordon & Gordon F. Newell, 1967. "Closed Queuing Systems with Exponential Servers," Operations Research, INFORMS, vol. 15(2), pages 254-265, April.
  • Handle: RePEc:inm:oropre:v:15:y:1967:i:2:p:254-265
    DOI: 10.1287/opre.15.2.254
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1287/opre.15.2.254?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. J. P. van der Gaast & M. B. M. de Koster & I. J. B. F. Adan, 2018. "Conveyor Merges in Zone Picking Systems: A Tractable and Accurate Approximate Model," Service Science, INFORMS, vol. 52(6), pages 1428-1443, December.
    2. Daisik Nam & Minyoung Park, 2020. "Improving the Operational Efficiency of Parcel Delivery Network with a Bi-Level Decision Making Model," Sustainability, MDPI, vol. 12(19), pages 1-19, September.
    3. Tuǧrul Dayar & Akın Meriç, 2008. "Kronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizes," Annals of Operations Research, Springer, vol. 164(1), pages 193-210, November.
    4. Xiaoju Zhang & Huijuan Li & Meng Wu, 2022. "Optimization of Resource Allocation in Automated Container Terminals," Sustainability, MDPI, vol. 14(24), pages 1-16, December.
    5. Bharat Raj Wagle & R. P. Ghimire, 2024. "Performance Evaluations of Vehicle Sharing in Closed Queueing Networks System," SN Operations Research Forum, Springer, vol. 5(2), pages 1-16, June.
    6. Sahba, Pedram & BalcIog[small tilde]lu, BarIs, 2011. "The impact of transportation delays on repairshop capacity pooling and spare part inventories," European Journal of Operational Research, Elsevier, vol. 214(3), pages 674-682, November.
    7. Kang, Seungmo & Medina, Juan C. & Ouyang, Yanfeng, 2008. "Optimal operations of transportation fleet for unloading activities at container ports," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 970-984, December.
    8. Santiago R. Balseiro & David B. Brown & Chen Chen, 2021. "Dynamic Pricing of Relocating Resources in Large Networks," Management Science, INFORMS, vol. 67(7), pages 4075-4094, July.
    9. Manuel Alberto M. Ferreira & Marina Andrade & José António Filipe & Manuel Pacheco Coelho, 2011. "Statistical Queuing Theory with Some Applications," International Journal of Finance, Insurance and Risk Management, International Journal of Finance, Insurance and Risk Management, vol. 1(4), pages 190-190.
    10. Valeriy A. Naumov & Yuliya V. Gaidamaka & Konstantin E. Samouylov, 2019. "On Two Interacting Markovian Queueing Systems," Mathematics, MDPI, vol. 7(9), pages 1-12, September.
    11. Jonatha Anselmi & Bernardo D'Auria & Neil Walton, 2013. "Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence," Mathematics of Operations Research, INFORMS, vol. 38(3), pages 469-491, August.
    12. Choi, S. H. & Lee, J. S. L., 2001. "Computational algorithms for modeling unreliable manufacturing systems based on Markovian property," European Journal of Operational Research, Elsevier, vol. 133(3), pages 667-684, September.
    13. Nico Dijk & Barteld Schilstra, 2022. "On two product form modifications for finite overflow systems," Annals of Operations Research, Springer, vol. 310(2), pages 519-549, March.
    14. Zhang, Xiaoju & Zeng, Qingcheng & Sheu, Jiuh-Biing, 2019. "Modeling the productivity and stability of a terminal operation system with quay crane double cycling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 181-197.
    15. Shuji Kijima & Tomomi Matsui, 2008. "Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers," Annals of Operations Research, Springer, vol. 162(1), pages 35-55, September.

    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:15:y:1967:i:2:p:254-265. 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.