A Max–Min Ant System algorithm to solve the Software Project Scheduling Problem

• We present the model of Software Project Scheduling Problem to be solved by an ACO metaheuristic.
• The model was implemented using the Max–Min Ant System algorithm and Hyper-Cube framework.
• We present the results obtained, which improves over other reported results using other metaheuristics.

The Software Project Scheduling Problem is a specific Project Scheduling Problem present in many industrial and academic areas. This problem consists in making the appropriate worker-task assignment in a software project so the cost and duration of the project are minimized. We present the design of a Max–Min Ant System algorithm using the Hyper-Cube framework to solve it. This framework improves the performance of the algorithm. We illustrate experimental results and compare with other techniques demonstrating the feasibility and robustness of the approach, while reaching competitive solutions.