Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-12-01T00:56:30.545Z Has data issue: false hasContentIssue false
  • English
  • Français

A second look at a queueing system with moving average input process

Published online by Cambridge University Press:  09 April 2009

P. D. Finch  and
C. Pearce
P. D. Finch
Affiliation:
The Australian National University, Canberra
C. Pearce
Affiliation:
The Australian National University, Canberra
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We consider a single-server queueing system with first-come first-served queue discipline in which (i) customers arrive at the instants 0 = A0 < A1 < A2 < …, with time interval between the mth and (m+1)th arrivals

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 5 , Issue 1 , February 1965 , pp. 100 - 106
Copyright
Copyright © Australian Mathematical Society 1965

References

[1]Finch, P. D., The single server queueing system with non-recurrent input process and Erlang service time, this Journal 3 (1963), 220—236.Google Scholar