An event-based reactive scheduling approach for the Resource Constrained Project Scheduling Problem with unreliable resources

摘要

The Resource Constrained Project Scheduling Problem (RCPSP) is a combinatorial optimization problem which is non-deterministic polynomial-time (NP)-hard in nature. Due to the diversified applications of RCPSPs, they have been commonly used as scheduling procedures in real-world problems. Since, in practice, project data are prone to changes or disruptions, this paper introduces a mathematical model for a reactive scheduling approach, called the Event Based Reactive Approach (EBRA). This proposed EBRA approach is employed to examine its recovery performance under both a single disruption and a series of independent resource disruptions. Several simulated disruption data are hypothesized to represent real-world disruption scenarios and, without loss of generality, the proposed reactive approach is proved to be efficient in reducing the number of variables and computational complexity and also to be resilient in realistic changes, such as duration inflation and dynamic resource usages. Along with employing an exact method by LINGO software, this paper also proposes an enhanced iterated greedy (EnIG) approach to meta-heuristically solve larger and computationally expensive benchmark instances taken from the Project Scheduling Library (PSPLIB).