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

Optimal preventive replacement policies for a system with discrete scheduled times

Author

Listed:
  • Yen-Luan Chen

Abstract

In reality, most operating systems are repaired or replaced when they have failed. For such systems, it would be reliable to maintain them in a control-limit consideration of repairs or operations. This article addresses a system scheduling policy for preventive replacement with discrete control limits of minimal repair and random work. An operating system which works at random times for multiple jobs (N tandem jobs or N parallel jobs) is considered. The system subjects to two failure mechanisms and maintained imperfectly: type-I (minor) failure rectified by a minimal repair and type-II (catastrophic) failure removed by a corrective replacement. To control the deterioration process, the preventive replacement is planned to undergo before catastrophic failure at number n of minimal repairs or the completion of N multiple jobs. The objective is to determine the optimal discrete scheduling replacement parameters (n* or N*) that minimizes the mean cost rate function in a finite time horizon. Model analysis relating to the existence and uniqueness of optimal solutions is provided. A Numerical example is presented for illustrative purposes.

Suggested Citation

  • Yen-Luan Chen, 2023. "Optimal preventive replacement policies for a system with discrete scheduled times," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 52(5), pages 1356-1368, March.
  • Handle: RePEc:taf:lstaxx:v:52:y:2023:i:5:p:1356-1368
    DOI: 10.1080/03610926.2021.1926513
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2021.1926513?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:5:p:1356-1368. 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.