Condition-based maintenance optimisation for multi-component systems using mean residual life
Bibliographic record
Abstract
This paper aims to propose a Novel Condition-based maintenance (CBM) decision aid model for optimising the maintenance of complex multi-component systems. As the degradation level of each component is assumed to be independent and stochastic, it follows a specific probability distribution determined from historical data of experimental observations and inspection. The main objective is to optimise the total cost for providing maintenance actions and reducing the excess of spare parts usage. The decision support model consists of determining measurements on components with the aim of estimating the instant of time of removing predictively one or a group of components before they fail. The measurement model includes the mean residual lifetime (MRL) and some extensions developed for this purpose. For demonstrating the pertinency of the proposed model, we use a preventive maintenance strategy for one-component systems and a grouping/opportunistic maintenance for multi-component systems. Besides, a numerical comparative study performing these measurements is carried out using several examples and a case study from Electric energy distribution systems. The solution is illustrated as a decision-making optimal model for optimising the maintenance operations’ costs and the total number of spare parts. The numerical results and the comparison show the efficiency of the proposed approach.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".