Optimal replacement with minimal repair policy for a system operating over a random time horizon
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Purpose This paper aims to investigate the optimization of the replacement with minimal repair policy for a system which experiences a time horizon of random length. Under such policy system replacement occurs at multiples of some period while minimal repair is performed at system failure between two successive replacements. Design/methodology/approach The objective function is the expected total cost composed of minimal repairs and replacements costs. A simple and compact expression is derived for the expected total costs and conditions under which an optimal replacement period exits are given. For sake of illustration, a numerical example is provided. Findings The paper finds that by the recent great technological development, the life cycle of present products is seen to be reduced more and more. This has motivated the development of maintenance optimization models for systems which experience an exact finite time horizon. Originality/value To ensure the benefits from the improved technologies, the information concerning the technological change must be taken into account. Such information is based on technological forecasting and difficult to obtain and merely rely on uncertainties.
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.
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.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 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 it