Optimal configuration selection for Reconfigurable Manufacturing Systems
Bibliographic record
Abstract
The selection of Reconfigurable Manufacturing Systems (RMS) configurations that include arrangement of machines, equipment selection, and assignment of operations, has a significant impact on their performance. This paper reviews the relevant literature and highlights the gaps that exist in this area of research. A novel “RMS Configuration Selection Approach” is introduced. It consists of two phases; the first deals with the selection of the near-optimal alternative configurations for each possible demand scenario over the considered configuration periods. It uses a constraint satisfaction procedure and powerful meta-heuristics, real-coded Genetic Algorithms (GAs) and Tabu Search (TS), for the continuous optimization of capital cost and system availability. The second phase utilizes integer-coded GAs and TS to determine the alternatives, from those produced in the first phase, that would optimize the degree of transition smoothness over the planning horizon. It uses a stochastic model of the level of reconfiguration smoothness (RS) across all the configuration periods in the planning horizon according to the anticipated demand scenarios. This model is based on a RS metric and a reconfiguration planning procedure that guide the development of execution plans for reconfiguration. The developed approach is demonstrated and validated using a case study. It was shown that it is possible to provide the manufacturing capacity and functionality needed when needed while minimizing the reconfiguration effort. The proposed approach can provide decision support for management in selecting RMS configurations at the beginning of each configuration period.
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.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 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".