Optimizing cell load regulation capability in dynamic cell 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
Variation in production cell load arises from machine loads exceeding their capacity and the constraints of cellular capacity. This issue has become increasingly critical in scheduling cellular manufacturing systems. In this paper, we propose a novel approach for scheduling in dynamic cellular manufacturing systems. The objective is to minimize cell load variations and associated costs while achieving a balance between internal manufacturing and subcontracting. To address this, we developed a mixed-integer linear programming (MILP) mathematical model, which was solved using LINGO 19.0 software. The model focuses on reducing cell load variation, minimizing associated costs, and optimizing the balance between internal production and subcontracting. Extensive computational experiments use medium-scale problem instances with randomly generated demand scenarios. The results demonstrate the effectiveness of the proposed model in generating optimal solutions, significantly reducing cell load variation and related costs. Furthermore, computational efficiency is notable, with solutions obtained in very low processing times. This underscores the model's practical applicability and robustness in addressing real-world scheduling challenges in cellular manufacturing systems.
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.000 | 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.001 |
| 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