New effective algorithm for Dynamic Resource Constrained Project Scheduling Problem

Many scheduling problems use a solution representation composed of a list of n (number of tasks/activities) values defining when those elements must be scheduled/executed. In resource constrained versions, in addition to dependence constraints, there are other constraints involving the use of an amount of resource to execute the activities. All these constraints may make the solution handling before mentioned very difficult. Many algorithms have troubles to generate feasible solutions, if the instance is hard. This paper proposes a new solution representation that allows a very high degree of freedom at working with generated solutions. A new Evolutionary Algorithm is also proposed to exemplify this capacity