A Lagrangian heuristic for sprint planning in agile software development

详细信息    查看全文

• 作者：Marco A. Boschetti ; Matteo Golfarelli ; Stefano Rizzi ; Elisa Turricchia
• 关键词：Mixed integer linear programming ; Software engineering ; Agile methods ; Optimization models ; Matheuristics ; Lagrangian heuristics
• 刊名：Computers and Operations Research
• 出版年：March, 2014
• 年：2014
• 卷：43
• 期：Complete
• 页码：116-128
• 全文大小：863 K

文摘

Agile methods for software development promote iterative design and implementation. Most of them divide a project into functionalities, called user stories; at each iteration, often called a sprint, a subset of user stories are developed. The sprint planning phase is critical to ensure the project success, but it is also a difficult problem because several factors impact on the optimality of a sprint plan, e.g., the estimated complexity, business value, and affinity of the user stories to be included in each sprint. In this paper we present an approach for sprint planning based on an integer linear programming model. Given the estimates made by the project team and a set of development constraints, the optimal solution of the model is a sprint plan that maximizes the business value perceived by users. Solving to optimality the model by a general-purpose MIP solver, such as IBM Ilog Cplex, takes time and for some instances even finding a feasible solution requires too large computing times for an operational use. For this reason we propose an effective Lagrangian heuristic based on a relaxation of the proposed model and some greedy and exchange algorithms. Computational results on both real and synthetic projects show the effectiveness of the proposed approach.