The single server queueing system with Non-recurrent input-process and Erlang service time
1963 ◽
Vol 3
(2)
◽
pp. 220-236
◽
Keyword(s):
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.
1965 ◽
Vol 5
(1)
◽
pp. 100-106
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
1997 ◽
Vol 34
(03)
◽
pp. 800-805
◽
Keyword(s):
Keyword(s):
Keyword(s):
2006 ◽
Vol 51
(3)
◽
pp. 519-525
◽
Keyword(s):
1984 ◽
Vol 16
(4)
◽
pp. 887-905
◽