An Efficient Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem
Abstract: The resource-constrained project scheduling problem (RCPSP) has a broad range of practical applications, e.g., in manufacturing, mining, and supply chain, among others(Kreter et al., 2015). Over the last 50 years, many researchers have tried to solve this challenging NP-hard problem. This paper presents an efficient and easy-to-implement relax-and-solve matheuristic to solve RCPSP. The proposed method employs constraint programming in a heuristic framework and uses CPLEX as an optimization solver. This algorithm is tested on more than 1500 instances from the standard library PSPLIB. Our experimental results show that the proposed heuristic framework outperforms the CPLEX and provides competitive results compared with the state-of-the-art techniques.
Loading