Coordinating production and recycling decisions with stochastic demand and return
Bibliographic record
Abstract
In this paper, the joint production and recycling problem is investigated for a hybrid manufacturing and remanufacturing system where brand-new products are produced in the manufacturing plant and recycled products are remanufactured into as-new products in the remanufacturing facility. Both the brand-new products and remanufactured products are used to satisfy customer demands. Returns of used products that are recycled from customers are assumed to be stochastic and nonlinearly price-dependent. A mathematical model is proposed to maximize the overall profit of the system through simultaneously optimizing the production and recycling decisions, subject to two capacity constraints — the manufacturing capacity and the remanufacturing capacity. Based on Lagrangian relaxation method, subgradient algorithm and heuristic algorithm, a solution approach is developed to solve the problem. A representative example is presented to illustrate the system, and managerial analysis indicates that the uncertainties in demand and return have much influence on the production and recycling policy. In addition, twenty randomly produced examples are solved, and computational results show that the solution approach can obtain very good solutions for all examples 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.
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.007 | 0.015 |
| Meta-epidemiology (narrow) | 0.001 | 0.002 |
| Meta-epidemiology (broad) | 0.003 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.004 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.003 | 0.002 |
| 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".