Condition-based selective maintenance for stochastically degrading multi-component systems under periodic inspection and imperfect maintenance
Bibliographic record
Abstract
This article proposes a novel condition-based selective maintenance model for a multi-component system running multiple missions interspersed with scheduled intermission breaks. Each component in the system degrades according to a time-dependent stochastic process and fails whenever its degradation level reaches a prespecified threshold. Failures of system components are revealed only through periodic inspections performed during a mission. The decision to repair components found in a failed state is made at the beginning of the following break. However, a penalty cost proportional to the expected component downtime is incurred. To improve the probability of the system successfully completing its next mission, maintenance activities are carried out on its components during the breaks. Each component can be imperfectly maintained or replaced. The level at which maintenance is performed determines the improvement degree in the component health. Cost and time structures are developed to take into account the trade-offs between the cost of an imperfect maintenance action and its resulting health improvement. Given the limited duration of the break and the required reliability target for the next mission, the condition-based selective maintenance problem aims at finding an optimal subset of maintenance actions to be performed on the selected components to minimize the total expected cost which is the sum of the total expected maintenance, inspection and penalty costs. All parameters and components of this nonlinear selective maintenance optimization problem are developed and thoroughly discussed. Numerical experiments are provided to illustrate the modelling steps and show the validity 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.001 | 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".