An Activity-List based Nested Partitions algorithm for Resource-Constrained Project Scheduling

In this paper, we propose an Activity-List based Nested Partitions algorithm for solving the Resource-Constrained Project Scheduling Problem(RCPSP). This algorithm is based on traditional Serial Scheduling scheme (SSS) and partitions the feasible solution space which is formulated by activity-lists into subregions by the nested partitions approach. We also utilize Double Justification as local search to improve the solutions. The algorithm is tested on J120 in PSPLIB with the result that the algorithm is relatively effective for solving large-scale, complex RCPSPs.