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

Optimal scheduling imperfect maintenance policy for a system with multiple random works

Author

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

Abstract

This paper investigates a scheduling imperfect maintenance policy for an operating system that works at random times for multiple jobs (n tandem jobs or n parallel jobs). We consider the system suffers from type-I failure which is corrected by a minimal repair, or type-II failure, which is disaster and is eliminated by a corrective maintenance. To control the deterioration process, preventive maintenance is design to go through at a scheduling time T or the completion of multiple jobs, whichever occurs last. Each maintenance is performed imperfectly, the system improves yet its failure characteristic is also changed after maintenance. Lastly, the system is displaced at the N-th maintenance. On the basis minimizes the mean cost rate, this paper derived the optimal scheduling parameters (T*, n*, N*) analytically and numerically, according to its existence and uniqueness. The models we proposed will provide a general structure for maintenance theory of reliability.

Suggested Citation

  • Yen-Luan Chen & Chin-Chih Chang, 2025. "Optimal scheduling imperfect maintenance policy for a system with multiple random works," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(7), pages 2033-2048, April.
    • Handle: RePEc:taf:lstaxx:v:54:y:2025:i:7:p:2033-2048
    DOI: 10.1080/03610926.2024.2356061
    as

    Download full text from publisher

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