Sequencing and Scheduling Optimization in Low-Volume Low-Variety Production Systems
Bibliographic record
Abstract
Despite prominent scholarly advancements in scheduling optimization approaches for a wide range of production systems, limited research has been reported on sequencing and scheduling optimization strategies in Low-Volume Low-Variety production systems. This dissertation fills the gap in the current literature through the formulation and the proposal of a suite of mathematical programming models and heuristic algorithms, capturing the unique characteristics and constraints inherent in such production systems. In the first section of this dissertation a suite of mixed-integer multi-objective linear mathematical programming models are proposed for solving discrete-time single work center scheduling problems, distinguished by a key decision criterion of permitting or prohibiting the traveling of incomplete activities. It was evident through personal observations however, that there exist scenarios where resources are shared between parallel work centers, which yielded to further research in the use of shared resource pools in multi-parallel work center scheduling problems. A novel suite of mathematical programming models are proposed for solving single and multi-parallel work center scheduling problems with shared or dedicated resources. The mathematical programming models formulated in this section are modular, signifying that constraints can be added or removed without jeopardizing the integrity of the mathematical models. The proposed optimization models were validated and verified through a real-world case study where significant cost savings in form of resource requirements are realized through the integration of shared resource pools. It is often the case however, that activity processing times and planning horizon are not discrete. To tackle continuous-time work center scheduling problems a novel suite of mathematical programming models is formulated and proposed in the final section of this dissertation, as well as two new genetic algorithms for solving large-scale scheduling problems. The proposed mathematical programming models and metaheuristics are aimed at optimizing the production schedule as well as activity execution sequence to minimize overall cost and resource requirements. The optimization models proposed through this dissertation are validated and verified through a real-world case study of the final assembly line of a narrow body private aircraft, where the problems were solved to optimality.
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.003 |
| 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.003 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".