Mixed integer formulations for a coupled lot-scheduling and vehicle routing problem in furniture settings
Bibliographic record
Abstract
We propose and analyze two mathematical programming models for a production, inventory, distribution and routing problem considering real and relevant features from the furniture industry, such as production sequence-dependent setup times, heterogeneous fleet of vehicles, routes extending over one or more periods of the production planning horizon, multiple time windows and customers’ deadlines, among others. These features are rarely jointly considered in the related literature, but commonly found in real-world applications. The models properly represent the problem in this industrial sector and can be used as a tool to support production and distribution planning in small companies. A large set of random and realistic instances is used to contrast the performance of the models in terms of both solution quality and computational effort. It is shown how much integrating production and distribution decisions in a single framework helps to reduce the total cost of the system, in comparison with a sequential approach that follows a common practice in this industry. This cost reduction comes at a higher computational effort, though.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.003 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.003 | 0.002 |
| Insufficient payload (model declined to judge) | 0.006 | 0.001 |
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".