Production Planning of a Failure-Prone Manufacturing/Remanufacturing System with Production-Dependent Failure Rates
Bibliographic record
Abstract
This paper deals with the production-dependent failure rates for a hybrid manufacturing/remanufacturing system subject to random failures and repairs. The failure rate of the manufacturing machine depends on its production rate, while the failure rate of the remanufacturing machine is constant. In the proposed model, the manufacturing machine is characterized by a higher production rate. The machines produce one type of final product and unmet demand is backlogged. At the expected end of their usage, products are collected from the market and kept in recoverable inventory for future remanufacturing, or disposed of. The objective of the system is to find the production rates of the manufacturing and the remanufacturing machines that would minimize a discounted overall cost consisting of serviceable inventory cost, backlog cost and holding cost for returns. A computational algorithm, based on numerical methods, is used for solving the optimality conditions obtained from the application of the stochastic dynamic programming approach. Finally, a numerical example and sensitivity analyses are presented to illustrate the usefulness of the proposed approach. Our results clearly show that the optimal control policy of the system is obtained when the failure rates of the machine depend on its production rate.
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.003 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 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".