IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v56y2024i12p1245-1262.html
   My bibliography  Save this article

Dynamic inspection and maintenance scheduling for multi-state systems under time-varying demand: Proximal policy optimization

Author

Listed:
  • Yiming Chen
  • Yu Liu
  • Tangfan Xiahou

Abstract

Inspection and maintenance activities are effective ways to reveal and restore the health conditions of many industrial systems, respectively. Most extant works on inspection and maintenance optimization problems have assumed that systems operate under a time-invariant demand. Such a simplified assumption is oftentimes violated by a changeable market environment, seasonal factors, and even unexpected emergencies. In this article, with the aim of minimizing the expected total cost associated with inspections, maintenance, and unsupplied demand, a dynamic inspection and maintenance scheduling model is proposed for Multi-State Systems (MSSs) under a time-varying demand. Non-periodic inspections are performed on the components of an MSS and imperfect maintenance actions are dynamically scheduled based on the inspection results. By introducing the concept of decision epochs, the resulting inspection and maintenance scheduling problem is formulated as a Markov Decision Process (MDP). The Deep Reinforcement Learning (DRL) method with a Proximal Policy Optimization (PPO) algorithm is customized to cope with the “curse of dimensionality” of the resulting sequential decision problem. As an extra input feature for the agent, the category of decision epochs is formulated to improve the effectiveness of the customized DRL method. A six-component MSS, along with a multi-state coal transportation system, is given to demonstrate the effectiveness of the proposed method.

Suggested Citation

  • Yiming Chen & Yu Liu & Tangfan Xiahou, 2024. "Dynamic inspection and maintenance scheduling for multi-state systems under time-varying demand: Proximal policy optimization," IISE Transactions, Taylor & Francis Journals, vol. 56(12), pages 1245-1262, December.
  • Handle: RePEc:taf:uiiexx:v:56:y:2024:i:12:p:1245-1262
    DOI: 10.1080/24725854.2023.2259949
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/24725854.2023.2259949?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:uiiexx:v:56:y:2024:i:12:p:1245-1262. 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/uiie .

    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.