A Single-Server Queue with Recurrent Input and Exponentially Distributed Service Times
- 1 June 1962
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 10 (3) , 395-399
- https://doi.org/10.1287/opre.10.3.395
Abstract
Combinatorial methods are given for the determination of the distribution of the queue size, the waiting time, the number of customers served in a busy period and the length of a busy period for a single-server queuing process with recurrent input and exponentially distributed service times.Keywords
This publication has 0 references indexed in Scilit: