Answers are grounded in this paper and cite their sources.
Summary The queueing problem considered is that in which (i)the customers are scheduled to arrive at equal time intervals but a customer may arrive at any time after the start of the interval during which he was scheduled to arrive, or may even not arrive at all; the lateness distribution is perfectly general.(ii)the total service-time of a customer is supposed to consist of a finite number of stages, such that the times spent in each of the stages are independent and identically distributed, and the probability of leaving a stage at any time depends on the time since the current scheduling interval began. A method is discussed which enables the non-equilibrium distribution of the queue length at any time to be derived, and results for the equilibrium distribution are given. Most of the results relate to the case in which there is a single server but extensions of the argument for more than one server are outlined.
No takes yet. Share an insight, caveat, or question.
Albert G. Mercer (1960) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: