Dynamic reduction of time costs on IT-project by forming teams of compatible programmers

Abstract

The combinatorial problem of forming programming teams has been studied in several works. The proposed techniques and algorithms for solving the problem account for various aspects and parameters of the software development process and programming teams’ operation. The problem is NP-hard in general case. Accounting for compatibility of programmers leads to forming teams with increased efficiency of operation which reduces IT-project time costs. Our previous work researched how the compatibility of programmers influences the overall runtime of teams. This paper proposes a more accurate dynamic model of calculating the programmers’ time costs changes during forming teams. At each adding of a programmer to a team, the model recalculates the time costs of the programmers and teams accounting for their compatibility. The advanced dynamic optimization algorithm of stepwise pairwise merging of teams be developed in the paper aims to reduce the time costs of the project the programmers are working on. The created software and conducted computational experiments have shown the reduction in project time costs by tens of percent for large sets of programmers