Performance evaluation of the remanufacturing system prone to random failure and repair
Bibliographic record
Abstract
Implementation of new environmental legislation and public awareness has increased the responsibility of manufacturers. Remanufacturing has been applied in many industries and sectors since its introduction. However, only 10% to 20% of the returned products pass through the remanufacturing process, and the remaining products are disposed in the landfills. Uncertainties like high failure rates of the servers, buffer capacities, and inappropriate preventive maintenance policies would be responsible for most of the delays in remanufacturing operations. In this paper, a simulation-based experimental methodology is used to determine the optimal preventive maintenance frequency and buffer allocation in a remanufacturing line. Moreover, an estimated relationship between preventive maintenance frequency and Mean Time Between Failure (MTBF), is presented to determine the best preventive maintenance frequency. The solution approach is applied to computer remanufacturing industry. Analysis of variance (ANOVA), and regression analysis are performed to denote the most influential factors to remanufacturing cycle time (performance measures). A case study is used to show the applicability of the modelling approach in assessing and improving the cycle time, and the profit of a remanufacturing line . Managerial insights are highlighted to support managers and decision-makers in their quest for more efficient and smooth operation of the remanufacturing system.
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.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| 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".