Abstract
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
Publisher
Cambridge University Press (CUP)
Reference1 articles.
1. The single server queueing system with non-recurrent input process and Erlang service time;Finch;Journal,1963
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献