Bibliographic record
Abstract
This study proposes models to find the optimal non-periodic inspection interval over a finite planning horizon for two types of multi-component repairable systems. The first system consists of hard-type and soft-type components, and the second system is a k-out-of-m system with m identical components. The failures of components in both systems follow a non-homogeneous Poisson process. The failure of soft-type components and the failure of components in a k-out-of-m system when the number of failed components is still less than m-k+1, are soft failures. Soft failures are revealed only at scheduled inspections or when an event of opportunistic inspection or a system failure occurs. The failures of hard-type components or the failure of (m-k+1)th failed component in a k-out-of-m system are hard failures, and cause the system to stop functioning. Hard failures are revealed immediately and the failed components are fixed. In this study, a failed component is either replaced or minimally repaired according to its age at failure time. To find the optimal inspection schedules for the systems, we minimize the total expected cost of the systems over a finite planning horizon. The total cost for the first type of system includes the costs of components’ minimal repairs, replacements, downtimes, and the scheduled inspections. The total cost of a k-out-of-m system has an additional penalty cost for system failures. We consider a binary variable for a possible scheduled inspection’s time, in which 1 indicates performing a planned inspection at that time, and 0 shows no inspection to be performed. Thus, our goal is to find the optimal vector of binary decision variables which results in the minimum total cost of the system. A recursive formula is developed to calculate the expected number of minimal repairs, replacements and downtime of soft-type components. However since obtaining the expected values from the mathematical formula is cumbersome, we develop a simulation model to obtain the total expected cost for a given non-periodic inspection scheme. We then integrate the simulation model with a genetic algorithm to obtain the optimal inspection scheme.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".