Resilience-based restoration model for supply chain networks

22Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Mao, X., Lou, X., Yuan, C., & Zhou, J. (2020). Resilience-based restoration model for supply chain networks. Mathematics, 8(2). https://doi.org/10.3390/math8020163

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free