Search

Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP) is a scheduling problem that works with an uncommon kind of resources: the Dynamic Resources. They increase and decrease in quantity according to the activated tasks and are not bounded like other project scheduling problems. This paper presents a new mathematical formulation for DRCPSP as well as two hybrid heuristics merging an evolutionary algorithm with an exact approach. Computational results show that both hybrid heuristics present better results than the state-of-the-art algorithm for DRCPSP does. The proposed formulation also provides better bounds. [ABSTRACT FROM AUTHOR]