An integrated model of scheduling, batch delivery and supplier selection in a make-to-order manufacturing system
Bibliographic record
Abstract
This paper analyzes a supply chain, which consists of a manufacturer, a retailer and several suppliers in which the retailer orders jobs to the manufacturer and the suppliers provide the requiring parts. The manufacturer schedules and processes the orders and dispatches them to the retailer either individually or collectively in batches. The manufacturer incurs a penalty cost for each tardy job and a transportation cost for every delivered batch and therefore, searches for a schedule that yields minimum number of tardy jobs and batches. Moreover, the manufacturer tries to optimize its supplying cost through locating the suppliers that offer appropriate release times and costs for manufacturing parts. Since the release times of parts directly affect scheduling of orders, in this research, we develop an integrated mathematical model for the manufacturer that incorporates suppliers' selection issue into the scheduling and batching decisions. Furthermore, we present a heuristic algorithm (greedy algorithm) and also a local search to quickly determine the optimal or near-optimal solutions. The computational analysis shows the importance of the integrated model and also the superiority and effectiveness of the heuristic algorithms.
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.003 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.003 | 0.001 |
| Insufficient payload (model declined to judge) | 0.008 | 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".