Answers are grounded in this paper and cite their sources.
A number of authors have studied busy period problems for particular cases of the general single-server queueing system. For example, using the now standard notation of Kendall [7],GI/M/1 was studied by Conolly [3] and Takacs [18]. Earlier work onM/M/1 includes that of Ledermann and Reuter [8] and Bailey [1]. Kendall [6], Takacs [17], and Prabhu [11] have consideredM/G/1.
No takes yet. Share an insight, caveat, or question.
П. Д. Финч (1961) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: