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

The Machine Repair Problem with Heterogeneous Populations

Author

Listed:
  • Donald Gross

    (George Washington University, Washington, D.C.)

  • John F. Ince

    (Maritime Administration, Washington, D.C.)

Abstract

The classic machine repair with spares (finite source) queueing model assumes all calling units are identical in failure and repair characteristics. This paper develops, for a first-come first-served discipline, a procedure for treating nonhomogeneous populations, specifically, a population with two types of items, each with exponential failure and repair times but with different mean values. Exact solutions are obtained for small population sizes and compared to approximate procedures using the classical theory. The exact model is essentially a two-stage cyclic queue with two classes of customers. Extensions of the model to N stages and M customer classes, priority disciplines, and other disciplines, including blocking, are discussed.

Suggested Citation

  • Donald Gross & John F. Ince, 1981. "The Machine Repair Problem with Heterogeneous Populations," Operations Research, INFORMS, vol. 29(3), pages 532-549, June.
    • Handle: RePEc:inm:oropre:v:29:y:1981:i:3:p:532-549
    DOI: 10.1287/opre.29.3.532
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.29.3.532
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.29.3.532?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. William Liang & Barış Balcıog̃lu & Robert Svaluto, 2013. "Scheduling policies for a repair shop problem," Annals of Operations Research, Springer, vol. 211(1), pages 273-288, December.
    2. Yang, Taho & Lee, Rong-Shean & Chen, Mu-Chen & Chen, Pangwei, 2005. "Queueing network model for a single-operator machine interference problem with external operations," European Journal of Operational Research, Elsevier, vol. 167(1), pages 163-178, November.
    3. Dong Li & Nishant Mishra & Serguei Netessine, 2023. "Contracting for Product Support Under Information Asymmetry," Management Science, INFORMS, vol. 69(8), pages 4627-4645, August.

    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:29:y:1981:i:3:p:532-549. 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.