Two heuristic algorithms for RCPSP with NPV criterion

The resource constrained project scheduling problem (RCPSP) with the criterion of maximizing the net present value (NPV) is considered. We propose two heuristic algorithms for RCPSP based on idempotent algebra methods. To assess the quality of the algorithms, a zero-one integer linear programming model was built for the problem under consideration. This model makes it possible to find exact solutions to the problem using the IBM ILOG CPLEX. Experiments show that the proposed heuristic algorithms demonstrate high performance. In a series of experiments, schedules corresponding to exact solutions were obtained, among other things.