A simple dual-RAMP algorithm for resource constraint project scheduling

Abstract

A Relaxation Adaptive Memory Programming (RAMP) algorithm is developed to solve large-scale resource constrained project scheduling problems (RCPSP). The RAMP algorithm presented here takes advantage of a cross-parametric relaxation and extends a recent approach that casts the relaxed problem as a minimum cut problem. Computational results on a classical set of benchmark problems show that even a relatively simple implementation of the RAMP algorithm can find optimal or near-optimal solutions for a large set of those instances.