A new approach to solve the software project scheduling problem based on max–min ant system
MetadataShow full item record
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. © Springer International Publishing Switzerland 2014.
Showing items related by title, author, creator and subject.
Software project scheduling using the Hyper-Cube ant colony optimization algorithm [Programiranje računarskog projekta primjenom Hyper-Cube algoritma za optimizaciju kolonije mrava] (2020) Crawford B.; Soto R.; Johnson F.; Misra S.; Paredes F.; Olguín E. (Strojarski Facultet, 2015)
Conference PaperCrawford B.; Soto R.; Johnson F.; Monfroy E. (Springer Verlag, 2013)
ArticleCrawford B.; Soto R.; Johnson F.; Monfroy E.; Paredes F. (Elsevier Ltd, 2014)