Model and solution approach to coordinate production-inventory strategies considering nonlinear price-sensitive demand: application to Canadian pulp and paper industry
Bibliographic record
Abstract
This study addresses a practical problem within a multi-level supply chain where a wide range of customers can be served through different strategies such as make-to-stock, make-to-order, or vendor-managed inventory. The customer demand is stochastic, and sensitive to pricing associated with different production-inventory strategies. We propose a two-stage stochastic mixed-integer non-linear programming model. In the first stage, decisions are made regarding the selection of production-inventory strategies and pricing to maximise the expected profit. The second stage involves decisions related to production, inventory, and distribution, which are used to evaluate the first-stage decisions under various scenarios with different levels of accuracy. To solve the model, a metaheuristic approach based on the Simulated Annealing algorithm is developed. To showcase the practical applicability of our model and solution approach, we use a real case study in a Canadian pulp and paper supply chain. The results revealed that both the production-inventory strategy assigned to customers and the sales price underwent changes across scenarios. Furthermore, we demonstrated that by implementing the SA algorithm, we could improve the initial profit by up to 1.43% through slight adjustments in the sales price and assigned strategies for customers.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 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.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".