A planning model for repairable spare part supply chain considering stochastic demand and backorder: an empirical investigation
Bibliographic record
Abstract
Today, improving machine availability is vital for industries to compete in the global market. Spare parts play an essential role in the maintenance and repair of equipment, but planning an extensive network in strategic industries with various spare parts can be very challenging due to the existence of different decision factors. The spare parts supply chain deals with inventory management issues, which necessitates considering the related decisions such as determining the stock level and order quantity. Moreover, demand uncertainty and long supply time make decision-making more complex. This paper presents a repair and supply planning model for repairable spare parts while considering a modified formulation of demand uncertainty to minimize costs. The model determines the optimal stock level, lateral transshipment, assignment of spare part orders to suppliers, equipment to repair centers, and the number of intervals over the planning horizon used in demand estimation. This research contributes to the literature by integrating recent decisions, using demand approximation by piecewise linearization, and considering backorder in warehouses evaluated by queuing models. A hybrid approach, including heuristic and genetic algorithms, is used to optimize the model using data from an oil company. The results show that using piecewise linearization and integrated repair and supply planning decisions optimizes costs and improves performance. Also, the availability is affected by the demand estimation, which necessitates precision prediction.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".