Answers are grounded in this paper and cite their sources.
Summary A queueing process is studied in which customers arrive at random and are served in order of arrival at each of a number of counters arranged in series. Each counter of the series is permitted to have “many servers”, and the distribution of service time for a customer at each phase of service (e.g. at each counter) is supposed to be negative exponential. The equilibrium solution for the general case is obtained, but more detail is given for the single server system.
No takes yet. Share an insight, caveat, or question.
R. R. P. Jackson (1956) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: