Title: Robust solutions for the software project scheduling problem: a preliminary analysis

Authors: Francisco Luna; Francisco Chicano; Enrique Alba

Addresses: Department of Computer Science, University of Málaga, Campus de Teatinos, 29071 Málaga, Spain. ' Department of Computer Science, University of Málaga, Campus de Teatinos, 29071 Málaga, Spain. ' Department of Computer Science, University of Málaga, Campus de Teatinos, 29071 Málaga, Spain

Abstract: The software project scheduling problem relates to the decision of who does what during a software project lifetime. This problem has a capital importance for software companies. In the software project scheduling problem, the total budget and human resources involved in software development must be optimally managed in order to end up with a successful project. Two are the main objectives identified in this problem: minimising the project cost and minimising its makespan. However, some of the parameters of the problem are subject to unforeseen changes. In particular, the cost of the tasks of a software project is one of the most varying parameters, since it is related to estimations of the productivity of employees. In this paper, we modify the formulation of the original bi-objective problem to add two new objectives that account for the robustness of the solutions to changes in the problem parameters. We address 36 instances of this optimisation problem using four state-of-the-art metaheuristic algorithms and compare the solutions with those of the original non-robust bi-objective problem.

Keywords: search-based software engineering; SBSE; robustness; software project scheduling; SPS; optimisation; metaheuristics.

DOI: 10.1504/IJMHEUR.2012.048218

International Journal of Metaheuristics, 2012 Vol.2 No.1, pp.56 - 79

Received: 23 Apr 2012
Accepted: 11 May 2012
Published online: 22 Oct 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article