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

Cyclic Queuing Systems with Restricted Length Queues

Author

Listed:
  • William J. Gordon

    (General Motors Research Laboratories, Warren, Michigan)

  • Gordon F. Newell

    (University of California, Richmond, California)

Abstract

This paper is concerned with an analysis of the stochastic behavior of a system of tandem queuing stations in which capacity restrictions are imposed on the queue lengths. The closed, cyclic systems that we consider are shown to be stochastically equivalent to open systems in which the number of customers is a random variable. A concept of duality is introduced on the basis of the simple observation that the sequential movement of customers through the stages generates a counter-sequential motion of “holes.” The implications of the duality relation are discussed at some length. The differential-difference equations for the time-dependent stochastic structure of the system are derived, and the remainder of the paper is devoted to the solution of the equilibrium equations for several special systems. First, we analyze completely systems with only two stages. The well-known results for a finite capacity queue appear as a special case. Next, systems are considered for which the number of customers is so small that there is no possibility of blocking. Then, by a duality argument, an analysis is carried out for systems with a very large number of customers in which the blocking effect dominates. Finally, we compare two extreme systems. In the one system there is no blocking and customers may queue at each stage. The other system has unit capacity at each of the M stages so that the distribution of customers is determined solely by the effect of blocking.

Suggested Citation

  • William J. Gordon & Gordon F. Newell, 1967. "Cyclic Queuing Systems with Restricted Length Queues," Operations Research, INFORMS, vol. 15(2), pages 266-277, April.
  • Handle: RePEc:inm:oropre:v:15:y:1967:i:2:p:266-277
    DOI: 10.1287/opre.15.2.266
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1287/opre.15.2.266?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. Palmer, Geraint I. & Harper, Paul R. & Knight, Vincent A., 2018. "Modelling deadlock in open restricted queueing networks," European Journal of Operational Research, Elsevier, vol. 266(2), pages 609-621.
    2. Genji Yamazaki & Hirotaka Sakasegawa, 1975. "Properties of duality in tandem queueing systems," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 27(1), pages 201-212, December.
    3. 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.
    4. Boucherie, R.J., 1991. "A dual process associated with the evolution of the state of a queueing network at its jumps," Serie Research Memoranda 0039, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    5. William A. Massey & Emmanuel Ekwedike & Robert C. Hampshire & Jamol J. Pender, 2023. "A transient symmetry analysis for the M/M/1/k queue," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 1-43, February.
    6. Ciuiu, Daniel, 2008. "Solving nonlinear systems of equations and nonlinear systems of differential equations by the Monte Carlo method using queueing networks and games theory," MPRA Paper 23434, University Library of Munich, Germany, revised Feb 2010.

    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:266-277. 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.