Mathematical Programming and Metaheuristics for Solving Continuous-Time Scheduling Optimization Problems in Low-Volume Low-Variety Production 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
Despite prominent scholarly advancements in the field of operations research, limited literature has been reported on mathematical and heuristic approaches for schedule the low-volume low-variety production systems. This paper proposes a new approach for modeling and solving large-scale sequencing and scheduling problems in Low-Volume Low-variety production systems. The proposed non-linear mathematical programming models and genetic algorithms are subject to time and resource constraints, aimed at maximizing the number of activities completed in-station or intended to minimize the positive deviation to the aspiring time and resources budgets, in scenarios where the allocated work package must be completed in-station. The proposed algorithms are compatible with discrete and continuous-time scheduling problems and are found to be effective in modeling characteristics and constraints inherent in Low-Volume, Low-Variety production systems. To validate the proposed models, a real-world case study of a work center in the final assembly line of a private jet aircraft is conducted.
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.001 |
| 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