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

作者：

Highlights：

• 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.

摘要

•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.

论文关键词：Ant Colony Optimization,Project management,Software engineering,Software Project Scheduling Problem

论文评审过程：Available online 14 May 2014.

论文官网地址：https://doi.org/10.1016/j.eswa.2014.05.003