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

A risk-aware maintenance model based on a constrained Markov decision process

Author

Listed:
  • Jianyu Xu
  • Xiujie Zhao
  • Bin Liu

Abstract

The Markov Decision Process (MDP) model has been widely studied and used in sequential decision-making problems. In particular, it has been proved to be effective in maintenance policy optimization problems where the system state is assumed to continuously evolve under sequential maintenance policies. In traditional MDP models for maintenance, the long-run expected total discounted cost is taken as the objective function. The maintenance manager’s target is to evaluate an optimal policy that incurs the minimum expected total discounted cost through the corresponding MDP model. However, a significant drawback of these existing MDP-based maintenance strategies is that they fail to incorporate and characterize the safety issues of the system during the maintenance process. Therefore, in some applications that are sensitive to functional risks, such strategies fail to accommodate the requirement of risk awareness. In this study, we apply the concept of risk-aversion in the MDP maintenance model to develop risk-aware maintenance policies. Specifically, we use risk functions to measure some indexes of the system that reflect the safety level and formulate a safety constraint. Then, we summarize the problem as a constrained MDP model and use the linear programming approach to evaluate the proposed risk-aware optimal maintenance policy under concern.

Suggested Citation

  • Jianyu Xu & Xiujie Zhao & Bin Liu, 2022. "A risk-aware maintenance model based on a constrained Markov decision process," IISE Transactions, Taylor & Francis Journals, vol. 54(11), pages 1072-1083, November.
  • Handle: RePEc:taf:uiiexx:v:54:y:2022:i:11:p:1072-1083
    DOI: 10.1080/24725854.2021.1973156
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/24725854.2021.1973156?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:54:y:2022:i:11:p:1072-1083. 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.