An heuristic algorithm for resources planning in software project

This paper introduces a new heuristic algorithm for solving a class of resource-constrained Project Scheduling problems with imposed completion time and where the duration of each activity is a function of resources committed to it. In the last decades a lot of research has been done on Project Scheduling problems with or without resources constraints, but very few papers consider the variable duration case. It introduces a mathematical model of the problem and shows it is a generalization of many scheduling problems. The paper then describes the new heuristics based on the partial exploration of a decision tree. Finally it shows how the algorithm’s structure is useful for the construction of a Decision Support System for the Project Scheduling problems.