Closed Finite Queuing Networks with Time Lags and with Several Classes of Units

M. Posner and B. Bernholtz
Additional contact information
M. Posner: University of Toronto, Toronto, Canada
B. Bernholtz: University of Toronto, Toronto, Canada

Operations Research, 1968, vol. 16, issue 5, 977-985

Abstract: The authors have previously investigated a broad class of closed, finite queuing networks with time lags, in which all units were considered to be identical. In this paper, that work is extended to the treatment of systems having several classes of units in which units belonging to different classes may have different sets of service parameters at the stations, different sets of travel-time distributions between stations, and different routing procedures through the system.

Date: 1968
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.5.977 (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:16:y:1968:i:5:p:977-985

Access Statistics for this article

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