Staffing a software project: A constraint satisfaction and optimization-based approach

被引:86
作者
Barreto, Ahilton [1 ]
Barros, Marcio de O. [2 ]
Werner, Claudia M. L. [1 ]
机构
[1] Univ Fed Rio de Janeiro, COPPE, Rio de Janeiro, RJ, Brazil
[2] DIA UNIRIO, Rio De Janeiro, RJ, Brazil
关键词
staffing; constraint satisfaction problems; branch and bound;
D O I
10.1016/j.cor.2007.01.010
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Software development is a people intensive activity. The abilities possessed by developers are strongly related to process productivity and final product quality. Thus, one of the most important decisions to be made by a software project manager is how to properly staff the project. However, staffing software projects is not a simple task. There are many alternatives to ponder, several developer-to-activity combinations to evaluate, and the manager may have to choose a team from a larger set of available developers, according to the project and organizational needs. Therefore, to perform the staffing activity with ad hoc procedures can be very difficult and can lead the manager to choose a team that is not the best for a given situation. This work presents an optimization-based approach to support staffing a software project. The staffing problem is modeled and solved as a constraint satisfaction problem. Our approach takes into account the characteristics of the project activities, the available human resources, and constraints established by the software development organization. According to these needs, the project manager selects a utility function to be maximized or minimized by the optimizer. We propose several utility functions, each addressing values that can be sought by the development organization. A decision support tool was implemented and used in an experimental study executed to evaluate the relevance of the proposed approach. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:3073 / 3089
页数:17
相关论文
共 35 条
  • [1] Abdel-Hamid T., 1991, Software Project Dynamics: An Integrated Approach
  • [3] ACUNA ST, 2003, PROSIM SOFTW PROC SI
  • [4] [Anonymous], 1993, FDN CONSTRAINT SATIS
  • [5] ANTONIO G, 2001, P IEEE INT C SOFTW M
  • [6] Antoniol G, 2005, PROC IEEE INT CONF S, P240
  • [7] APPLEGATE D, 2001, ORSA J COMPUTING, V3, P149
  • [8] The next release problem
    Bagnall, AJ
    Rayward-Smith, VJ
    Whittley, IM
    [J]. INFORMATION AND SOFTWARE TECHNOLOGY, 2001, 43 (14) : 883 - 890
  • [9] BARRETO AS, 2005, 7 INT WORKSH EC DRIV
  • [10] Basili V., 1999, IEEE T SOFTWARE ENG, V25