Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

System States for a Series of Finite Queues

Brian J. Haydon
Operations Research
Vol. 20, No. 6 (Nov. - Dec., 1972), pp. 1137-1141
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/169303
Page Count: 5
  • Download ($30.00)
  • Cite this Item
System States for a Series of Finite Queues
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
1137
    1137
  • Thumbnail: Page 
1138
    1138
  • Thumbnail: Page 
1139
    1139
  • Thumbnail: Page 
1140
    1140
  • Thumbnail: Page 
1141
    1141