Skip to main content
SpringerLink
Log in

Queueing analysis of a discrete closed-loop conveyor with service facilities

  • Contributed Papers
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider a discrete closed-loop conveyor system consisting of a loading station, an unloading station, and a number of carriers which move with constant speed along a closed track. At the loading station units arrive in batches while the arrival of batches is governed by a Poisson process. The units queue at the loading station and await there the arrival of an empty carrier. Each unit requires some amount of service which is provided while the unit is on a carrier. After completion of service a unit leaves the system as soon as it reaches the unloading station. Our interest focuses on the steady-state queue length at the loading station. We obtain explicit results for the case where units leave their carriers on passing the unloading station for the second time. We were motivated to study this case by a slotted ring protocol for local area networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P.E. Boudreau, J.S. Griffin and M. Kac, An elementary queueing problem, Amer. Math. Monthly 69 (1962) 713–724.

    Google Scholar 

  2. W. Bux, Local-area subnetworks: a performance comparison, IEEE Trans. Commun., Vol. COM-29 (1981) 1465–1473.

    Google Scholar 

  3. A. Hopper, S. Temple and R. Williamson,Local Area Network Design (Addison-Wesley, Reading, MA, 1986).

    Google Scholar 

  4. P.J.B. King and I. Mitrani, Modelling a slotted ring local area network, IEEE Trans. Comp., Vol. C-36 (1987) 554–561.

    Google Scholar 

  5. A.G. Konheim and B. Meister, Service in a loop system, J. Assoc. Comp. Mach. 19 (1972) 92–108.

    Google Scholar 

  6. I. Mitrani, J.L. Adams and R.M. Falconer, A modelling study of the Orwell ring protocol, in:Teletraffic Analysis and Computer Performance Evaluation, eds. O.J. Boxma, J.W. Cohen and H.C. Tijms (North-Holland, Amsterdam, 1986) pp. 429–438.

    Google Scholar 

  7. H. Wielandt,Finite Permutation Groups (Academic Press, New York, 1964).

    Google Scholar 

  8. M. Zafirovic-Vukotic, I.G. Niemegeers and D. Valk, Performance analysis of slotted ring protocols in HSLANs, IEEE J. Select. Areas Commun., Vol. SAC-6 (1988) 1011–1024.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Applied Mathematics, University of Twente, P.O. Box 217, 7500, AE Enschede, The Netherlands

    B. van Arem, E. A. van Doorn & T. M. J. Meijer

Authors
  1. B. van Arem
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. A. van Doorn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. M. J. Meijer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

van Arem, B., van Doorn, E.A. & Meijer, T.M.J. Queueing analysis of a discrete closed-loop conveyor with service facilities. Queueing Syst 4, 95–114 (1989). https://doi.org/10.1007/BF01158547

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01158547

Keywords

Search

Navigation