Detailed scheduling of harvest teams and robust use of harvest and transportation resources
Bibliographic record
Abstract
Planning activities of harvest teams (harvesting and forwarding) and transportation is critical for efficient procurement of roundwood from forests to mills. The planning process involves many integrated decisions that consider process, spatial and temporal aspects. The spatial aspect concerns which area to harvest, which machine team to use, the mill to which the timber should be allocated and where to store the timber. The process decisions involve which bucking instruction to use. The temporal aspect concerns when to harvest, when to transport in order to meet specific demand at mills, and when to store the timber. Temporal decisions also include determining a detailed schedule for each harvest team. Such a schedule includes starting time and movement time between harvest areas. This is complicated by the harvest team having different home bases and different machine systems with their specific performance description and capacities. The overall planning problem can be formulated into one optimization model, but such a model is too large for practical use and cannot be solved in a reasonable time. We propose a decomposition scheme where a sequence of aggregated models, or limited parts of the model, is solved to find high-quality solutions quickly. We test the scheduling in cases involving two large Swedish forest companies.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 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".