DYNAMIC REDUCTION OF TIME COSTS ON IT-PROJECT BY FORMING TEAMS OF COMPATIBLE PROGRAMMERS

UDC 004.4−004.9

 

Prihozhy Anatoly Alexievich − DSc (Engineering), Professor, Professor, the Department of Computer and System Software. Belarusian National Technical University (65, Nezalezhnasti Ave., 220013, Minsk, Republic of Belarus). E-mail: prihozhy@yahoo.com

DOI: https://doi.org/10.52065/2520-6141-2024-278-11.

 

Key words: programmer, project, time costs, compatibility of programmers, forming teams, optimization.

For citation: Prihozhy А. А. Dynamic reduction of time costs on IT-project by forming teams of compatible programmers. Proceedings of BSTU, issue 3, Physics and Mathematics. Informatics, 2024, no. 1 (278), pp. 70–76. DOI: 10.52065/2520-6141-2024-278-11.

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.

Download

References

  1. Rachlin, J. N., Goodwin, R. T., Murthy, S., Akkiraju, R., Wu, F., Kumaran, S., Das, R. A-Teams: An Agent Architecture for Optimization and Decision-Support. In: Müller, J. P., Rao, A. S., Singh, M. P. (eds). Intelligent Agents V: Agents Theories, Architectures, and Languages. ATAL, 1998. Lecture Notes in Computer Science. Berlin; Heidelberg, Springer, 1999, vol. 1555, pp. 1–15.
  2. Britto R., Neto P. S., Rabelo R., Ayala W. and Soares T. A hybrid approach to solve the agile team allocation problem. 2012 IEEE Congress on Evolutionary Computation, 2012, pp. 1−8.
  3. Prihozhy A. A., Zhdanouski A. M. Genetic algorithm of allocating programmers to groups. Nauka – obrazovaniyu, proizvodstvu, ekonomike: materialy 13-y Mezhdunarodnoy nauchno-prakticheskoy konferentsii [Science to education, industry and economics: Proceedings of 13th international conference. Vol. 1]. Minsk, 2015, pp. 286–287 (In Russian).
  4. Gutierrez J. H., Astudillo C. A., Ballesteros-Perez P., Mora-Melia D. and Candia-Vejar A. The multiple team formation problem using sociometry. Computers and Operations Research, 2016, vol. 75, pp. 150−162.
  5. Masood Z., Hoda R., Blincoe K. Exploring Workflow Mechanisms and Task Allocation Strategies in Agile Software Teams. In: Baumeister H., Lichter H., Riebisch M. (eds). Agile Processes in Software Engineering and Extreme Programming. XP 2017. Lecture Notes in Business Information Processing. Springer, 2017, vol. 283, pp. 267–273.
  6. Prihozhy A. A., Zhdanouski A. M. Method of qualification estimation and optimization of professional teams of programmers. System analysis and applied information science, 2018, no. 2, pp. 4−11 (In Russian).
  7. Prihozhy A. A. Exact and greedy algorithms of allocating experts to maximum set of programmer teams. System analysis and applied information science, 2022, no. 1, pp. 40–46.
  8. Prihozhy A., Zhdanouski A. Genetic algorithm of optimizing the size, staff and number of professional teams of programmers. Open Semantic Technologies for Intelligent Systems, Minsk, BSUIR Publ., 2019, pp. 305–310.
  9. Prihozhy A. A., Zhdanouski A. M. Genetic algorithm of optimizing the qualification of programmer teams. System analysis and applied information science, 2020, no. 4, pp. 31–38.
  10. Prihozhy A. A. Optimization of data allocation in hierarchical memory for blocked shortest paths algorithms. System analysis and applied information science, 2021, no. 3, pp. 40–50.
  11. Prihozhy А. А. Optimization of programming teams on compatibility of programmers. Trudy BGTU [Proceedings of BSTU], issue 3, Physics and Mathematics. Informatics, 2023, no 2 (272), pp. 104–110.

07.12.2023