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

Machine Repair as a Priority Waiting-Line Problem

Author

Listed:
  • Thomas E. Phipps

    (Operations Evaluation Group, Massachusetts Institute of Technology, P.O. Box 2176, Potomac Station, Alexandria, Virginia)

Abstract

A paper by Cobham (Cobham, A. 1954. J. Opns. Res. Soc. Am. 2 70.) in this Journal, dealing with the assignment of priorities in waiting-line problems, is taken as the basis for treatment of a particular variety of machine-repair problem in which shortest jobs, rather than first arrivals, receive highest priority. Cobham's results for the single channel case are found to be easily applicable to this type of priority assignment. These results take a particularly simple form when the priority-labeling index is allowed to assume continuous, rather than discrete, values. They apply to any case in which a one-channel facility repairs random failures from a very large population of machines.

Suggested Citation

  • Thomas E. Phipps, 1956. "Machine Repair as a Priority Waiting-Line Problem," Operations Research, INFORMS, vol. 4(1), pages 76-85, February.
    • Handle: RePEc:inm:oropre:v:4:y:1956:i:1:p:76-85
    DOI: 10.1287/opre.4.1.76
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.4.1.76
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.4.1.76?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. Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
    2. Hyytiä, Esa & Penttinen, Aleksi & Aalto, Samuli, 2012. "Size- and state-aware dispatching problem with queue-specific job sizes," European Journal of Operational Research, Elsevier, vol. 217(2), pages 357-370.
    3. W. Rogiest & K. Laevens & J. Walraevens & H. Bruneel, 2015. "Random-order-of-service for heterogeneous customers: waiting time analysis," Annals of Operations Research, Springer, vol. 226(1), pages 527-550, March.

    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:4:y:1956:i:1:p:76-85. 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.