IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v29y1983i10p1198-1208.html
   My bibliography  Save this article

A Fluid Flow Model of Networks of Queues

Author

Listed:
  • James S. Vandergraft

    (Automated Sciences Group, Inc., Silver Spring, Maryland)

Abstract

This paper describes a new technique for modeling flow through a network of queues. The advantages of this method over many discrete event simulations or queueing theory techniques include simplicity, low cost and portability. The paper describes the kinds of processes to which the technique can be applied, and the characteristics of the process that can be determined by the resulting model. An example of claims processing in a Social Security Administration's District Office is given. The basis for the technique is to model the information flow by a fluid flow, and then use standard engineering ideas to describe the fluid flow by a system of ordinary differential equations. The system of equations is solved by well-known numerical methods.

Suggested Citation

  • James S. Vandergraft, 1983. "A Fluid Flow Model of Networks of Queues," Management Science, INFORMS, vol. 29(10), pages 1198-1208, October.
  • Handle: RePEc:inm:ormnsc:v:29:y:1983:i:10:p:1198-1208
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.29.10.1198
    Download Restriction: no

    Citations

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


    Cited by:

    1. S. Göttlich & S. Kühn & J. A. Schwarz & R. Stolletz, 2016. "Approximations of time-dependent unreliable flow lines with finite buffers," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(3), pages 295-323, June.
    2. Gordon H. Lewis & Ashok Srinivasan & Eswaran Subrahmanian, 1998. "Staffing and Allocation of Workers in an Administrative Office," Management Science, INFORMS, vol. 44(4), pages 548-570, April.

    More about this item

    Keywords

    networks; queueing theory; simulation;

    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:ormnsc:v:29:y:1983:i:10:p:1198-1208. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc). General contact details of provider: http://edirc.repec.org/data/inforea.html .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.