Networks of Waiting Lines
Published Online:1 Aug 1957https://doi.org/10.1287/opre.5.4.518
Abstract
One of the least understood classes of operations problems is that concerned with the design, loading, and, especially, the scheduling of discrete, statistically varying flows through complex networks. The present paper abstracts what is perhaps the simplest theoretical question related to this class of problems, and derives expressions for certain steady-state parameters.
