Availability modeling and optimization of reconfigurable manufacturing systems
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
Reconfiguration mechanisms lead to the design of robust manufacturing systems which have the capability to allow the service continuity, in the presence of a failure, on the basis of a minimal degradation of performances. In this paper, a stochastic model is proposed to assess and to analyze the availability of reconfigurable systems whose equipments are subject to random failures. To distinguish between the normal behavior and the degraded one, the production rate is used as a performance measure. An availability model that takes into account the performance degradation is developed. Close form solutions of the steady‐state availability and the production rate of a reconfigurable system are calculated. Two optimization problems dealing with reconfigurable systems are also addressed. The paper considers a series system consisting of N stochastically independent components. Different technologies are assumed to be available for each component. The following design problems are studied: find the configuration, which allows maximizing the production rate of the system under resource constraints; and find the configuration that allows to reach some predetermined level of production rate at minimal cost. The design model of the first problem leads to mixed linear programming, while the design model of the second problem leads to integer linear programming. A numerical procedure is developed to solve both problems.
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.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 it