[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Single line queue with recurrent repeated demands

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We analyze a model queueing system in which customers cannot be in continuous contact with the server, but must call in to request service. If the server is free, the customer enters service immediately, but if the server is occupied, the unsatisfied customer must break contact and reapply for service later. There are two types of customer present who may reapply. First transit customers who arrive from outside according to a Poisson process and if they find the server busy they join a source of unsatisfied customers, called the orbit, who according to an exponential distribution reapply for service till they find the server free and leave the system on completion of service. Secondly there are a number of recurrent customers present who reapply for service according to a different exponential distribution and immediately go back in to the orbit after each completion of service. We assume a general service time distribution and calculate several characterstic quantities of the system for both the constant rate of reapplying for service and for the case when customers are discouraged and reduce their rate of demand as more customers join the orbit.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. O.J. Boxma and J.W. Cohen, TheM/G/1 queue with permanent customers, IEEE J. Select. Areas Commun. 9 (1991) 179–184.

    Google Scholar 

  2. B.D. Choi, K.K. Park and C.E.M. Pearce, An M/M/1 retrial queue with control policy and general retrial times, Queuing Systems 14 (1993) 275–292.

    Google Scholar 

  3. B.W. Conolly, Generalized state-dependent Erlangian queues: Speculations about calculating measures of effectiveness, J. Appl. Prob. 23 (1975) 358–363.

    Google Scholar 

  4. G.I. Falin, On the waiting-time process in a single line queue with repeated calls, J. Appl. Prob. 23 (1986) 185–192.

    Google Scholar 

  5. K. Farahmand, Single line queue with repeated demands, Queueing Systems 6 (1990) 223–228.

    Google Scholar 

  6. J. Keilson, J. Cozzolino and H. Young. A service system with unfilled requests repeated, Oper. Res. 16 (1968) 1126–1132.

    Google Scholar 

  7. J. Keilson and A. Koosharian, On time dependent queueing processes, Ann. Math. Stat. 31 (1960) 104–112.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Ulster, BT37 0QB, Co. Antrim, Northern Ireland

    K. Farahmand

Authors
  1. K. Farahmand
    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

Farahmand, K. Single line queue with recurrent repeated demands. Queueing Syst 22, 425–435 (1996). https://doi.org/10.1007/BF01149182

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation