Resilience-Based Restoration Model for Supply Chain Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
An optimal restoration strategy for supply chain networks can efficiently schedule the repair activities under resource limits. However, a wide range of previous studies solve this problem from the perspective of cost-effectiveness instead of a resilient manner. This research formulates the problem as a network maximum-resilience decision. We develop two metrics to measure the resilience of the supply chain networks, i.e., the resilience of cumulative performance loss and the resilience of restoration rapidity. Then, we propose a bi-objective nonlinear programming model, which aims to maximize the network resilience under the budget and manpower constraints. A modified simulated annealing algorithm is employed to solve the model. Finally, a testing supply chain network is utilized to illustrate the effectiveness of the proposed method framework. The results show that the optimal restoration schedule generated by the proposed model is a tradeoff between the cumulative performance loss and the restoration rapidity. Additionally, the sensitivity analysis of parameters indicates that decision-maker’s preference, tolerance factor of delivery time, number of work crews, and availability of budget all have significant impacts on the restoration schedule.
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.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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 it