IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v23y1977i7p756-767.html
   My bibliography  Save this article

A Discrete Time, Single Server Queue from a Finite Population

Author

Listed:
  • Do Le Minh

    (University of New South Wales, Australia)

Abstract

One of the standard assumptions in queueing theory is that the system operates for an indefinite period of time. This assumption, however, is not valid for many practical situations where there is only a finite number of customers and each customer requires service only once. This paper studies such a finite queueing system in which all customers have the same time-dependent arrival probability function. The method of solution allows one to "follow" each customer to record his arrival and departure times. While the study of the former is straightforward, the generating function of the departure time probabilities and the expected departure time of each customer are expressed in terms of the emptiness probabilities, which can be calculated from a recurrence relation. When the arrival probability function is independent of time, explicit results are obtained.

Suggested Citation

  • Do Le Minh, 1977. "A Discrete Time, Single Server Queue from a Finite Population," Management Science, INFORMS, vol. 23(7), pages 756-767, March.
    • Handle: RePEc:inm:ormnsc:v:23:y:1977:i:7:p:756-767
    DOI: 10.1287/mnsc.23.7.756
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.23.7.756
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.23.7.756?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. Moshe Haviv & Liron Ravner, 2021. "A survey of queueing systems with strategic timing of arrivals," Queueing Systems: Theory and Applications, Springer, vol. 99(1), pages 163-198, October.

    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:ormnsc:v:23:y:1977:i:7:p:756-767. 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.