An Algorithm for Computing Serial Correlations of Times in GI/G/1 Queues with Rational Arrival Processes

C. M. Woodside and B. Pagurek
Additional contact information
C. M. Woodside: Carleton University, Ottawa, Canada
B. Pagurek: Carleton University, Ottawa, Canada

Management Science, 1979, vol. 25, issue 1, 54-63

Abstract: An algorithm is given for computing the serial correlations of the waiting time, and of the time in system, for successive customers in a GI/G/1 queue. The method depends on representing the inter-arrival time distribution in terms of a process in class K r (i.e., distributions with a rational Laplace transform). Thus Erlang, hyperexponential and weighted sum-of-Erlang arrivals are treated exactly, and approximate results can be found for other distributions. Computed correlation functions for some Erlang/Erlang systems are presented as examples.

Keywords: autocorrelation function; general queue; waiting times; computation (search for similar items in EconPapers)
Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.25.1.54 (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:ormnsc:v:25:y:1979:i:1:p:54-63

Access Statistics for this article

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