System States for a Series of Finite Queues

Brian J. Haydon
Additional contact information
Brian J. Haydon: The University of New South Wales, Kensington, New South Wales, Australia

Operations Research, 1972, vol. 20, issue 6, 1137-1141

Abstract: This note describes a method of classifying and enumerating the feasible system states of a series of finite queues. The method utilizes matrix multiplication to combine subsystems or to add extra stations to an existing system, storing the classified states of an L -station system in an L -dimensional array.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.6.1137 (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:20:y:1972:i:6:p:1137-1141

Access Statistics for this article

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