Maintenance optimization of series systems subject to reliability constraints
W. Raphael and
Reliability Engineering and System Safety, 2018, vol. 180, issue C, 179-188
The extension of maintenance optimization methodologies used for single component to multiple component systems must take into account the interdependencies that may exist between the components. Such dependencies could arise when the maintenance optimization of the system over the time is subject to constraints. In this paper, a methodology using Lagrangian relaxation techniques embedded in dynamic programming is proposed for minimizing the maintenance costs of reliability constrained series systems. The methodology could be applied to deterministic and probabilistic dynamic programming problems, as well as to partially observable Markov Decision process. The computational complexity of the proposed approach is polynomial in the number Q of the system components. Theoretical and practical issues related to the existence, and the computation of the Lagrange multipliers are considered. The proposed methodology is illustrated by a numerical application considering maintenance planning of a pipeline.
Keywords: Maintenance; Optimization; Series systems; Reliability constraints; Interdependencies (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:reensy:v:180:y:2018:i:c:p:179-188
Access Statistics for this article
Reliability Engineering and System Safety is currently edited by Carlos Guedes Soares
More articles in Reliability Engineering and System Safety from Elsevier
Bibliographic data for series maintained by Dana Niculescu ().