An Optimal Imperfect Maintenance Policy for a Partially Observed System With Obvious Failures and Limited Repairs
Hongdong Fan, Zhaoqiang Wang, Jinying Wu and 1 more
IEEE Access · 2019
doi:10.1109/access.2019.2920513 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In this paper, we investigate an imperfect maintenance optimization problem for a multi-state, Markovian deterioration system with obvious failures under repair restriction based on those non-periodically collected sensor information. Our aim is to adaptively schedule observations and other maintenance actions with taking imperfect maintenance effect into consideration. Different from most existing works, imperfect maintenance here means that repair action can not only restore the system to a less deteriorated level instead of the good-as-new state but also accelerate the deterioration process so that the system can be repaired only a limited number of times before it must be replaced with a new one. Assuming that the system's deterioration state evolves as a discrete-time Markov chain with a finite state space, and then choosing the information state together with the number of completed repair times as state variable, we formulate the problem as a Markov decision process over an infinite time horizon. In order to increase the computational efficiency, several key structural properties are developed by minimizing the long-run average cost per unit time. Then, special algorithms are proposed to find the optimal maintenance policies. Finally, a numerical example is given to illustrate the effectiveness of the proposed algorithms.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.