BATCH SCHEDULING IN CUSTOMER-CENTRIC SUPPLY CHAINS(<Special Issue>Advanced Planning and Scheduling for Supply Chain Management)
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
Supply chain scheduling is a new emerging area of research. We study batch arrival scheduling problems at the manufacturer in a multi-level customer-centric supply chain, where promised job due dates are considered constraints which must be satisfied. We analyze the tradeoff between inventory holding costs and batch delivery costs. We show that the problems are closely related to batch scheduling problems on a single machine with flow-time related objectives. We prove that minimizing the sum of total weighted flow time and delivery costs is strongly NP-hard. For the unweighted version of the problem, we present efficient solution algorithms both for single machine and assembly systems. We also develop a dynamic programming solution for minimizing the sum of maximum flow time and delivery costs.
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.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| 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