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

An M / M / m / n Queue for the Shortest Distance Priority Machine Interference Problem

Author

Listed:
  • Gary H. Reynolds

    (West Virginia University, Morgantown, West Virginia)

Abstract

A mathematical model is developed for the machine interference problem with the priority of servicing the nearest machine in need of repair. The walking distance to a repair can be very significant in such large scale problems as law enforcement and guerrilla warfare where a first-in-first-out priority would, most likely, yield meaningless results. Compared with other models depicting the problem as a Markov process, the shortest distance priority yields the largest number of operating machines under steady-state conditions.

Suggested Citation

  • Gary H. Reynolds, 1975. "An M / M / m / n Queue for the Shortest Distance Priority Machine Interference Problem," Operations Research, INFORMS, vol. 23(2), pages 325-341, April.
    • Handle: RePEc:inm:oropre:v:23:y:1975:i:2:p:325-341
    DOI: 10.1287/opre.23.2.325
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.23.2.325
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.23.2.325?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
    ---><---

    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:23:y:1975:i:2:p:325-341. 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.