An Adaptive Memory Programming Framework For The Resource-Constrained Project Scheduling Problem

The Resource-Constrained Project Scheduling Problem (RCPSP) is one of the most intractable combinatorial optimisation problems that combines a set of constraints and objectives met in a vast variety of applications and industries. Its solution raises major theoretical challenges due to its complexity, yet presenting numerous practical dimensions. Adaptive memory programming (AMP) is one of the most successful frameworks for solving hard combinatorial optimisation problems (e.g. vehicle routing and scheduling). Its success stems from the use of learning mechanisms that capture favourable solution elements found in high-quality solutions. This paper challenges the efficiency of AMP for solving the RCPSP, to our knowledge, for the first time in the literature. Computational experiments on well-known benchmark RCPSP instances show that the proposed AMP consistently produces high-quality solutions in reasonable computational times.