DocumentCode
3186261
Title
Metaheuristics to solve the software project scheduling problem
Author
Parra, N. ; Carolina, D. ; Salazar, Addisson ; Edgar, J.
Author_Institution
Lab. de Comput. de Alto Rendimiento, LCAR, Univ. del Tachira, San Cristobal, Venezuela
fYear
2012
fDate
1-5 Oct. 2012
Firstpage
1
Lastpage
10
Abstract
This document describes the software project scheduling problem as a combinatorial optimization problem trough the Project Scheduling Problem (PSP). The authors represent the problem as a single-objective problem, which is solved through a group of metaheuristics, including an hybrid strategy that allows to schedule software projects, by minimizing either cost or duration. The metaheuristics implemented were validated with 18 instances of software projects with different number of developers, tasks and skills.
Keywords
combinatorial mathematics; optimisation; scheduling; software engineering; PSP; combinatorial optimization problem; hybrid strategy; single-objective problem; software project scheduling problem; Abstracts; Adaptation models; Optimization; Processor scheduling; Schedules; Silicon compounds; Software; Hybrid Strategy; Metaheuristics; Software Project Scheduling Problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Informatica (CLEI), 2012 XXXVIII Conferencia Latinoamericana En
Conference_Location
Medellin
Print_ISBN
978-1-4673-0794-9
Type
conf
DOI
10.1109/CLEI.2012.6427160
Filename
6427160
Link To Document