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

The Probability Law of the Busy Period for Two Types of Queuing Processes

Author

Listed:
  • Lajos Takács

    (Columbia University, New York, New York)

Abstract

A simple combinatorial method is given for the determination of the joint distribution of the length of the busy period and the number of customers served during this period for two types of single-Berver queuing processes. (1) Customers arrive at a counter according to a Poisson process and the service times have a general distribution, (2) customers arrive at a counter according to a recurrent process and the service times have an exponential distribution.

Suggested Citation

  • Lajos Takács, 1961. "The Probability Law of the Busy Period for Two Types of Queuing Processes," Operations Research, INFORMS, vol. 9(3), pages 402-407, June.
    • Handle: RePEc:inm:oropre:v:9:y:1961:i:3:p:402-407
    DOI: 10.1287/opre.9.3.402
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.9.3.402
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.9.3.402?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. Stadje, W., 1995. "The busy periods of some queueing systems," Stochastic Processes and their Applications, Elsevier, vol. 55(1), pages 159-167, January.

    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:9:y:1961:i:3:p:402-407. 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.