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

Optimal maintenance policies for a k-out-of-n system with replacement bias costs

Author

Listed:
  • Chin-Chih Chang
  • Yen-Luan Chen

Abstract

In this paper, the issue of determining an optimal age replacement is explored by incorporating minimal repair, preventive replacement, and corrective replacement into a k-out-of-n system subject to shocks. The k-out-of-n system in question consists of n identical components, and functions if at least k components function. Each shock causes the failure of a random number of components; if at least n-k + 1 components fail, the system fails and implements corrective replacement, otherwise the system is minimally repaired. The system is scheduled to implement preventive replacement before failure at age T or at the complement of a random working cycle, whichever occurs first or last. In order to balance the bias time between preventive replacement and corrective replacement, a replacement bias cost is also taken into account for planning replacement policies. The present paper develops a two-phase maintenance methodology and determines the optimal number of components and preventive replacement age that minimize the expected cost rate functions. For each model, the expected cost rate function is formulated analytically and optimized theoretically, and a numerical example is given to illustrate the applicability of the proposed methodology.

Suggested Citation

  • Chin-Chih Chang & Yen-Luan Chen, 2024. "Optimal maintenance policies for a k-out-of-n system with replacement bias costs," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(12), pages 3606-3619, August.
  • Handle: RePEc:taf:lstaxx:v:54:y:2024:i:12:p:3606-3619
    DOI: 10.1080/03610926.2024.2397066
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2024.2397066
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2024.2397066?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:54:y:2024:i:12:p:3606-3619. 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.