Modelling and optimization of multiple-aspect RMS configurations
Bibliographic record
Abstract
The configurations of Reconfigurable Manufacturing Systems (RMS) evolve over time in order to provide the functionality and capacity needed, when it is needed. This paper provides a model for optimizing the capital cost of RMS configurations with multiple aspects using Genetic Algorithms (GAs). The optimized configurations can handle multiple parts and their structure is that of a flow line allowing paralleling of identical machines in each production stage. The various aspects of the RMS configurations being considered include arrangement of machines (number of stages and number of parallel machines per stage), equipment selection (machine type and corresponding machine configuration for each stage) and assignment of operations (operation clusters assigned to each stage corresponding to each part type). A novel procedure to overcome the complexity of the search space by mapping from the discrete domain of the decision variables to a continuous domain of variables that guarantees the generation of feasible alternatives is introduced. A case study is presented to demonstrate the use of the developed optimization model for which a toolbox was developed using MATLAB software. The results show that the developed procedure not only overcomes the challenge of constraint satisfaction of such a complicated problem but also generates economical configurations in a reasonable time. This methodology can support manufacturing systems configuration selection decisions both at the initial design and reconfiguration stages.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 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.002 | 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".