Queues with semi-Markovian arrivals
Queues with semi-Markovian arrivals
复制标题
半马尔可夫到达的队列
DOI:
--
复制
发表时间:
1967
影响因子:
1
通讯作者:
E. Çinlar
中科院分区:
文献类型:
--
作者:
E. Çinlar
A queueing system with a single server is considered. There are a finite number of types of customers, and the types of successive arrivals form a Markov chain. Further, the nth interarrival time has a distribution function which may depend on the types of the nth and the n–1th arrivals. The queue size, waiting time, and busy period processes are investigated. Both transient and limiting results are given.