Integrating VMI into joint replenishment planning for optimized manufacturing supply chains
Bibliographic record
Abstract
This paper presents a new integrated framework combining the Joint Replenishment Problem (JRP) with a generalized Vendor Managed Inventory (VMI) system. The model under consideration represents a three-level supply chain consisting of a supplier, manufacturer, and retailer. The model incorporates multiple product types, each produced on a dedicated machine at the manufacturer, subject to setup costs, and major and minor ordering costs. The primary objective of this research is to optimize a set of critical decision variables, including the common order interval, order frequencies for each item, backorder levels at the retailer, and production initiation times at the manufacturer for each product type, under both deterministic and stochastic demand scenarios. This analysis will provide valuable insights for improving joint replenishment operations in manufacturing. The research begins with a deterministic model fit for the particular issue area derived from the canonical JRP. Within a VMI context, the manufacturer, acting as the supply chain leader, utilizes shared information to derive initial feasible solutions. Subsequently, an optimization technique is employed, combining marginal cost-based and cumulative cost-based algorithms, while leveraging embedded discrete Markov chain decomposition method adapting Jacobi stepping method to determine steady-state probabilities. A cost function is then defined for each action state within this framework. The integration of the VMI policy into the JRP model can significantly reduce the whole cost of the supply chain, through balancing between production initiation and backorders under both the deterministic and stochastic models.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".