Networks of Waiting Lines

James R. Jackson
Additional contact information
James R. Jackson: University of California, Los Angeles, California

Operations Research, 1957, vol. 5, issue 4, 518-521

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.

Date: 1957
References: Add references at CitEc
Citations: View citations in EconPapers (62)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.5.4.518 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:5:y:1957:i:4:p:518-521

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().