A series—parallel redundant reliability system for cellular manufacturing design
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
This paper presents a novel, multi-objective mixed-integer programming model for designing a cellular manufacturing system (CMS) that minimizes the total cost and maximizes the overall system reliability. In general, it is impossible to avoid production interruptions while handling machine breakdowns. In this situation, changing the process route dynamically can provide a quick response to meet production requirements. By assuming alternative process plans for operation—part requirements, the concept of the ‘reliable route’ proposed in the literature is extended. In a redundant reliability system with a series—parallel configuration, each reliable route is associated with an operation of a part (i.e. an operation—part) as a parallel subsystem. This route consists of a number of units or alternative machines allocated to cells in such a way that parts are processed with the maximum reliability for a given period of time. When an alternative machine breaks down, unprocessed parts are transferred to the next predetermined machine on the reliable route in order to complete their processes. While the reliable route approach increases the overall system reliability, the operational costs of the system also increase. To assess the present proposed model as a useful decision tool for the manager, various numerical examples are solved and analysed. Finally, the related computational results are reported.
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.001 | 0.001 |
| 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