# Emergency Repair Scheduling Model for Road Network Integrating Rescheduling Feature
## 2 Literature Review
This optimization problem was solved by constructing a resilience-based bilevel model to obtain the optimal repair time sequence of the road segments. The common assumption of repair resources that includes repair workers and equipment are characterized as work crews [41]. Taking advantage of the RCPSP definition, the proposed model treated repair resources as individual resources rather than the whole work crew, where the option of flexible resource assignment can be further considered. The type of resource in RCPSP activity can be divided into two categories: (1) renewable resources which can be used repeatedly by required activities (e.g., workers and equipment), and (2) non-renewable resources which are consumable with availability restrictions over the project period from the beginning to the end of the project (e.g., construction materials and repair project budget) [42; 43]. Only renewable resources are considered in the proposed RCPSP-oriented model. The main objective of RCPSP aims to minimize the total duration of the project schedule that consists of a set of activities linked by precedence constraints and restricted by multiple resource limitations [44; 45; 46; 47]. Several studies have proved that RCPSP is able to solve complex scheduling problems for achieving project management goals, under the circumstances of dealing with complicated resource allocation and assignment issues. [PERSON] and [PERSON] [48] proposed a genetic algorithm-based model in a single-mode RCPSP environment to obtain the minimum project duration. [PERSON] et al. [49] considered three different areas--the construction industry, information technology, and healthcare system--to validate the effectiveness of the proposed GA-based RCPSP model. Several studies utilized mixed-integer linear programming optimization models to solve RCPSP. [PERSON] et al. [50] developed a model for an extension of the RCPSP problem, called the multi-mode resource-collaboration and constrained scheduling problem (MRCCSP), for the semiconductor industry. [PERSON] et al. [51] developed a stochastic resource-constrained project scheduling problem (SRCPSP) which minimizes the makespan of a project with stochastic activity durations. A constrained logic programming (CLP) technique was applied with a branch-and-cut algorithm to solve the SRCPSP model. Besides the mixed-integer linear programming (MILP) and CLP techniques, constraint programming (CP) techniques were utilized for resource-constrained multi-project scheduling problems with alternative activity chains and time flexibility (RCMPSP-ACTF) by [PERSON] et al. [52]. From the past research we discussed above, only a few research studies discussed emergency repair issues for the road network. Moreover, we found that no studies can provide an integrated scheduling solution with a rescheduling feature to consider the first-wave and second-wave disaster damages at the same time, and apply RCPSP concepts to solve the emergency repair scheduling problem for the road network. Therefore, this research is then conducted with such motivations.