Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Erhan Çınlar (1967) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: