Exact and greedy algorithms of allocating experts to maximum set of programmer teams
The allocation of experts to programmer teams, which meet constraints on professional competences related to programming technologies, languages and tools an IT project specifies is a hard combinatorial problem. This paper solves the problem of forming the maximum number of teams whose experts meet...
Main Author: | A. A. Prihozhy |
---|---|
Format: | Article |
Language: | English |
Published: |
Belarusian National Technical University
2022-06-01
|
Series: | Sistemnyj Analiz i Prikladnaâ Informatika |
Subjects: | |
Online Access: | https://sapi.bntu.by/jour/article/view/552 |
Similar Items
-
Individual and team competencies in translational teams
by: Gaetano R. Lotrecchiano, et al.
Published: (2021-01-01) -
Methods of Allocation of Task Teams to the Planned Works
by: Kasprowicz T.
Published: (2019-06-01) -
Development of the educational programmes: normative legal and methodical support
by: Olena Khrutska
Published: (2018-12-01) -
The Effect of Continued Team Randomization on Student’s Perception and Performance in a Blended Team-Based Teaching Approach
by: Maryam Malekigorji
Published: (2019-05-01) -
Implementing an evidence-based competency model for science team training and evaluation: TeamMAPPS
by: Tiffany M. Bisbey, et al.
Published: (2021-01-01)