Exact and heuristic methods for the selective maintenance problem
T. Lust,
O. Roux and
F. Riane
European Journal of Operational Research, 2009, vol. 197, issue 3, 1166-1177
Abstract:
We present in this paper, new resolution methods for the selective maintenance problem. This problem consists in finding the best choice of maintenance actions to be performed on a multicomponent system, so as to maximize the system reliability, within a time window of a limited duration. When the number of components of the system is important, this combinatorial problem is not easy to solve, in particular because of the nonlinear objective function modeling the system reliability. This problem did not receive much attention yet. Consequently, rare are the effective resolution methods that are offered to the user. We thus developed heuristics and an exact method based on a branch and bound procedure, which we apply to various system configurations. We compare the obtained results, and we evaluate the best method to be used in various situations.
Keywords: Selective; maintenance; Reliability; Combinatorial; optimization; Branch; and; bound; Tabu; search (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (19)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00308-1
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:197:y:2009:i:3:p:1166-1177
Access Statistics for this article
European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati
More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().