IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v52y2023i4p1202-1216.html
   My bibliography  Save this article

Optimal preventive replacement last policy for a successive random works system with random lead time

Author

Listed:
  • Chin-Chih Chang

Abstract

Most systems deteriorate with age and use, and eventually, fail from either or both causes in random environment. It is reasonable in commercial industries that only one spare item is available for replacement. Selecting a cost efficient and effective replacement strategy to improve system reliability and inventory of spare parts is crucial work. In this paper, we consider an operating system which works at successive random times and models an imperfect maintenance action under two types of age-dependent failures, repairable minor failures (R) and unrepairable catastrophic failures (U). R failures are followed by a minimal repair and U failures are removed by a corrective replacement. A notation of preventive replacement last policy is considered in which the system is replaced before any U failures at age T or at number N of working times, whichever occurs last. A spare unit for replacement can be delivered upon order and is available only when the random lead time is finished. The main objective is to determine an optimal schedule (T, N) of that minimizes the mean cost rate function in a finite time horizon. The existence and uniqueness of optimal PRL policy are derived analytically and computed numerically.

Suggested Citation

  • Chin-Chih Chang, 2023. "Optimal preventive replacement last policy for a successive random works system with random lead time," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 52(4), pages 1202-1216, February.
    • Handle: RePEc:taf:lstaxx:v:52:y:2023:i:4:p:1202-1216
    DOI: 10.1080/03610926.2021.1926506
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2021.1926506
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2021.1926506?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:lstaxx:v:52:y:2023:i:4:p:1202-1216. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.