Firefly Algorithm to Solve a Project Scheduling Problem

This paper describes the Software Project Scheduling Problem (SPSP) as a combinatorial optimization problem. In this problem raises the need for a process to assign a set of resources to tasks for a project in a given time, trying to decrease the duration and cost. The workers are the main resource in the project. We present the design of the resolution model to solve the SPSP using an algorithm of fireflies (Firefly Algorithm, FA). We illustrate the experimental results in order to demonstrate the viability and soundness of our approach.