A Queue with Simultaneous Arrivals and Erlang Service Distribution

Rodrigo A. Restrepo
Additional contact information
Rodrigo A. Restrepo: Department of Mathematics, The University of British Columbia, Vancouver, British Columbia, Canada

Operations Research, 1965, vol. 13, issue 3, 375-381

Abstract: In this paper the method of generating functions is applied to a queue where the moments of arrival follow a Poisson distribution, but where at each of these moments several persons may arrive simultaneously. Assuming an Erlang distribution for the service times and first-come first-served discipline for the arriving groups, explicit formulas are obtained for the limiting values of the mean number of persons in the queue and in the system, and the mean time that a group of persons who arrive together must wait before one of them is served.

Date: 1965
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.13.3.375 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:13:y:1965:i:3:p:375-381

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().