Three step procedure for a multiple criteria problem of project portfolio scheduling

The project portfolio scheduling problem as a multiple criteria decision making problem and a three step procedure to solve this problem have been presnted. In the first step, the problem was described by a multiple criteria mathematical model. Three criteria have been considered: minimization of the sum of penalties for projects delays, minimization of resource overuse and NPV maximization. In the second step, non-dominated solutions were identified by using an elitist evolutionary algorithm for multiple optimization. In the third step, an interactive procedure has been applied to choose the final solution. An example of a portfolio of IT projects was used for computations.