Optimal maintenance policy for systems subject to random shocks: a semi-Markov decision process approach
Yongchao Liu , Xiujie Zhao
Complex Engineering Systems ›› 2026, Vol. 6 ›› Issue (3) : 16
This paper studies an average-cost maintenance optimization problem for a single-component system subject to continuous degradation and random shocks. The degradation process is modeled by a Gamma process, while random shocks arrive according to a Poisson process. A system failure occurs when either the degradation level reaches or exceeds its failure threshold, or the accumulated number of shocks reaches the shock failure threshold. Since failures are non-self-announcing, both the failure state and the system condition can only be revealed through inspections. To reduce the long-run operating cost, we propose a state-dependent non-periodic inspection and replacement policy, where the next inspection interval and the replacement action are jointly optimized according to the current degradation level and accumulated shock state. A numerical algorithm based on state-space discretization and bisection search is developed to compute the optimal policy. Numerical results show that the proposed policy consistently outperforms the optimized periodic inspection and replacement benchmark, with average-cost-rate reductions ranging from 8.60% to 29.33% across the tested parameter settings. Sensitivity analysis further demonstrates that the proposed policy consistently outperforms the benchmark policy under different cost, shock, and degradation parameter settings. The results confirm that dynamically adjusting inspection intervals according to the system state can effectively balance inspection cost, downtime cost, and replacement cost.
Non-periodic inspection / random shocks / gamma degradation / semi-Markov decision process / average cost rate
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
/
| 〈 |
|
〉 |