Sciweavers

Share
HM
2010
Springer

Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem

11 years 28 days ago
Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem
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. Keywords mathematical formulation
André Renato Villela da Silva, Luiz Satoru
Added 09 Nov 2010
Updated 09 Nov 2010
Type Conference
Year 2010
Where HM
Authors André Renato Villela da Silva, Luiz Satoru Ochi
Comments (0)
books