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

Optimal replacement scheduling for a multi-component system with failure interaction

Author

Listed:
  • Yen-Luan Chen

Abstract

In this study, we consider a system consisting of n different components with failure interaction. Each component suffers from either minor or major failure: the former is removed via minimal repair, while the latter induces complete failure of the system and requires corrective replacement of the system. This study investigates two scheduling problems of preventive replacement policies for a multi-component system that incorporates minimal repair, shortage, and excess costs. First, we consider the scheduling problem of an age replacement policy, in which the system is replaced at a planned time T or upon the occurrence of any major failure. Next, we consider that the system operates N successive random jobs without interruptions. In this scheduling problem, the system is replaced upon the accomplishment of N jobs or upon the occurrence of any major failure. For each scheduling problem, we derive the optimal scheduling parameter (T* or N*) analytically and numerically, according to their existence and uniqueness based on minimizing the mean cost rate function. Finally, a numerical example is designed to validate the theoretical results in this article.

Suggested Citation

  • Yen-Luan Chen, 2024. "Optimal replacement scheduling for a multi-component system with failure interaction," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(6), pages 2092-2102, March.
  • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:6:p:2092-2102
    DOI: 10.1080/03610926.2022.2117988
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2022.2117988?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:53:y:2024:i:6:p:2092-2102. 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.