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

1 May 1963

journal article
research article
Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society

Vol. 3 (2) , 220-236
https://doi.org/10.1017/s1446788700027968

Abstract

We consider a single server queueing system in which customers arrive at the instants t₀, t₁, …, t_m, …. We write τ_m = t_m+1 − t_m, 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.

Keywords

SERVER QUEUEING
QUEUEING SYSTEM
SINGLE SERVER
INPUT
WRITE
INTEGER
UNITY

This publication has 0 references indexed in Scilit: