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

Broderick Crawford, Ricardo Soto, Franklin Johnson, Eric Monfroy, Fernando Paredes

Research output: Contribution to journalArticlepeer-review

28 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)6634-6645
Number of pages12
JournalExpert Systems with Applications
Volume41
Issue number15
DOIs
StatePublished - 1 Nov 2014
Externally publishedYes

Keywords

  • Ant Colony Optimization
  • Project management
  • Software Project Scheduling Problem
  • Software engineering

Fingerprint

Dive into the research topics of 'A Max-Min Ant System algorithm to solve the Software Project Scheduling Problem'. Together they form a unique fingerprint.

Cite this