A new approach to solve the software project scheduling problem based on max–min ant system

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

This paper presents a new approach to solve the Software Project Scheduling Problem. This problem is NP-hard and consists in finding a workertask schedule that minimizes cost and duration for the whole project, so that task precedence and resource constraints are satisfied. Such a problem is solved with an Ant Colony Optimization algorithm by using the Max–Min Ant System and the Hyper-Cube framework. We illustrate experimental results and compare with other techniques demonstrating the feasibility and robustness of the approach, while reaching competitive solutions.

Original languageEnglish
Title of host publicationModern Trends and Techniques in Computer Science - 3rd Computer Science On-line Conference, CSOC 2014
EditorsRadek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Petr Silhavy, Zdenka Prokopova
PublisherSpringer Verlag
Pages41-51
Number of pages11
ISBN (Electronic)9783319067391
DOIs
StatePublished - 2014
Externally publishedYes
Event3rd Computer Science On-line Conference, CSOC 2014 -
Duration: 1 Apr 2014 → …

Publication series

NameAdvances in Intelligent Systems and Computing
Volume285
ISSN (Print)2194-5357

Conference

Conference3rd Computer Science On-line Conference, CSOC 2014
Period1/04/14 → …

Keywords

  • Ant colony optimization
  • Max–Min ant system
  • Project management
  • Software engineering
  • Software project scheduling problem

Fingerprint

Dive into the research topics of 'A new approach to solve the software project scheduling problem based on max–min ant system'. Together they form a unique fingerprint.

Cite this