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

Optimum sequential preventive maintenance first or last policies with imperfect maintenance for a system subject to shocks

Author

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

Abstract

This paper proposes and analyses the generalized sequential preventive maintenance policies for an operating system that works at random processing times and subject to shocks. The shocks arrive according to a non homogeneous Poisson process (NHPP) with varied intensity function in each maintenance interval. As a shock occurs, the system suffers two types of failures with number-dependent probabilities: type-I (minor) failure, which is rectified by a minimal repair, and type-II (catastrophic) failure, which is removed by a corrective maintenance. The imperfect maintenance is carried out to improve the system failure characteristic due to the altered shock process. The preventive maintenance-first and preventive maintenance-last policies are defined as that the system is maintained before any type-II failure occurs at a planned time Ti or at the completion of a working time in the i-th maintenance interval, whichever occurs first and last, respectively. At the N-th maintenance, the system is replaced rather than maintained. This paper aim is to minimize the mean cost rate as a measure of policy by determining optimal sequential maintenance parameters for each preventive maintenance policy. All discussions are presented analytically and determined numerically in terms of its existence and uniqueness.

Suggested Citation

  • Yen-Luan Chen & Chin-Chih Chang, 2022. "Optimum sequential preventive maintenance first or last policies with imperfect maintenance for a system subject to shocks," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 51(1), pages 162-178, January.
  • Handle: RePEc:taf:lstaxx:v:51:y:2022:i:1:p:162-178
    DOI: 10.1080/03610926.2020.1746807
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2020.1746807?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:51:y:2022:i:1:p:162-178. 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.