IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v20y1972i6p1137-1141.html
   My bibliography  Save this article

System States for a Series of Finite Queues

Author

Listed:
  • Brian J. Haydon

    (The University of New South Wales, Kensington, New South Wales, Australia)

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.

Suggested Citation

  • Brian J. Haydon, 1972. "System States for a Series of Finite Queues," Operations Research, INFORMS, vol. 20(6), pages 1137-1141, December.
  • Handle: RePEc:inm:oropre:v:20:y:1972:i:6:p:1137-1141
    DOI: 10.1287/opre.20.6.1137
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.20.6.1137
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.20.6.1137?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:20:y:1972:i:6:p:1137-1141. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.