Production scheduling and routing problem in the textile industry
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
In this paper we propose a two-phase solution approach to solve a combined routing and scheduling problem occurring in the textile industry where all fabrics are dyed by dye-jets and transported by forklifts. The objective is to minimize the cost of unproductive activities consisting of setup time due to dye-jets cleaning and forklifts waiting time. The first phase solves an integer linear program to assign jobs (fabrics) to dye-jets while minimizing the setup cost. We compare in this phase an arc formulation and a path-based formulation. In the second phase we use a mixed-integer linear program to deal with dye-jets scheduling and both routing and scheduling of forklifts. Experiments are performed on real data provided by a major multinational company and have been conducted using Cplex 12.4.0 and a column generation solver. Optimal solution is obtained in reasonable time.
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.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.001 |
| 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