articleTop 10% cited
Networks of Waiting Lines
Operations Research · 1957 · Vol. 5(4) · pp. 518–521
James R. Jackson✉(University of California, Los Angeles)
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.
Simulation Techniques and ApplicationsAdvanced Queuing Theory AnalysisStochastic processes and statistical mechanicsComputer scienceScheduling (production processes)Class (philosophy)Mathematical optimizationOperations researchMathematical economicsMathematicsArtificial intelligence
Citations
1,244
FWCI
4.15
field-weighted impact
References
5
Percentile
94%
vs. same field & year
Citations per year
Cited by
Closed Queuing Systems with Exponential Servers
Operations Research · 1967 · 684 citations
Physiological time-series analysis: what does regularity quantify?
American Journal of Physiology-Heart and Circulatory Physiology · 1994 · 1,321 citations
A state-of-the-art survey of dispatching rules for manufacturing job shop operations
International Journal of Production Research · 1982 · 1,007 citations
References
The Output of a Queuing System
Operations Research · 1956 · 702 citations
An introduction to probability theory and its applications
Journal of the Franklin Institute · 1958 · 29,713 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.
