Solving the combined flexible job shop scheduling and vehicle routing problem with stochastic features
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
Today’s competitive market conditions forces companies to implement strategies for the integration of production and transportation activities, but this is studied little in the literature. This paper considers the combined production and transportation problem in which the production system is defined as a flexible jobshop (FJS) and the transportation stage is modelled as a vehicle routing problem (VRP). Stochastic production processing times and vehicle travel times are considered. A simheuristic solution procedure is proposed, as a class of simulation-optimisation approach, based on Ant Colony Optimisation (production stage) and an iterative local search (transportation stage). Randomised data sets are used to evaluate the performance of the proposed solution procedure, with metrics such as total production time and delivery time demonstrating its effectiveness. Experimental outputs show the impact of considering stochasticity of these two parameters for better decision-making. Compared to existing methods, our approach offers significant improvements in efficiency and reliability.
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.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