System States for a Series of Finite Queues

Published Online:https://doi.org/10.1287/opre.20.6.1137

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.