The single server queue with Poisson input and semi-Markov service times
Keyword(s):
We assume that the successive service times in a single server queue with Poisson arrivals form an m-state semi-Markov process.The results for the M/G/1 queue are extended to this case. Both the time-dependence and the stationary solutions are discussed.
1966 ◽
Vol 3
(01)
◽
pp. 202-230
◽
Keyword(s):
1962 ◽
Vol 33
(4)
◽
pp. 1340-1348
◽
Keyword(s):
1974 ◽
Vol 11
(03)
◽
pp. 612-617
◽
1972 ◽
Vol 9
(02)
◽
pp. 370-381
◽
Keyword(s):
Keyword(s):
Keyword(s):