Max-Min Ant System to solve the software project scheduling problem

摘要

The Software Project Scheduling Problem is a special case of project scheduling problems. This problem consists in assigning workers with different skills, to a series of tasks in a software project so that the project is completed in the shortest time and the lowest cost possible. In addition, this allocation must meet the constraints of skill required for each task and the precedence constraints between tasks. The solution to this problem is presented using the Max — Min Ant System algorithm and the Hypercube framework. Two heuristics capable of guiding the algorithm to find better solutions are proposed. Experimental results are presented and compared with other techniques of resolution, showing an improvement by implementing our proposal.