An Approximation for the Moments of Waiting Times

C. R. Heathcote and P. Winer
Additional contact information
C. R. Heathcote: Australian National University, Canberra, Australia
P. Winer: Australian National University, Canberra, Australia

Operations Research, 1969, vol. 17, issue 1, 175-186

Abstract: Methods are available for computing properties of the waiting time associated with a variety of single-server queuing models in the equilibrium state. Since these calculations are more difficult in the time-dependent case, this paper develops an approximation procedure applicable to a wide class of single-server queues. Specifically, it considers the moments of the waiting time W n of the n th arriving customer of the system GI / G /1 and (given certain conditions) uses an expansion related to the central limit theorem to derive approximations to these moments. The expectation EW n is treated in some detail, particularly for the Erlang system E k / E m /1, and numerical illustrations are given. The same arguments apply to higher moments, but the calculations become tedious and details are not given.

Date: 1969
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.1.175 (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:17:y:1969:i:1:p:175-186

Access Statistics for this article

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