Sciweavers

Share
IPPS
2009
IEEE

New sequential and parallel algorithm for Dynamic Resource Constrained Project Scheduling Problem

11 years 6 months ago
New sequential and parallel algorithm for Dynamic Resource Constrained Project Scheduling Problem
This paper proposes a new Evolutionary Algorithm for the Dynamic Resource Constrained Project Scheduling Problem. This algorithm has new features that get around some problems like premature convergence and other ones. The indirect representation approach was used because it allows the construction of a feasible solution from any input priorities. A parallel version is also proposed, making good use of multicore processors available nowadays. The results of sequential and parallel versions were very significant, improving in almost all ways the best results present in literature.
André Renato Villela da Silva, Luiz Satoru
Added 24 May 2010
Updated 24 May 2010
Type Conference
Year 2009
Where IPPS
Authors André Renato Villela da Silva, Luiz Satoru Ochi
Comments (0)
books