Hostname: page-component-77c89778f8-gvh9x Total loading time: 0 Render date: 2024-07-16T12:36:06.206Z Has data issue: false hasContentIssue false

The single server queueing system with Non-recurrent input-process and Erlang service time

Published online by Cambridge University Press:  09 April 2009

P. D. Finch
Affiliation:
Dept. of Statistics, University of Melbourne.
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 in which customers arrive at the instants t0, t1, …, tm, …. We write τm = tm+1 − tm, m ≧ 0. There is a single server with distribution of service times B(x) given by where k is an integer not less than unity.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1963