Abstract
We consider the task of assigning teams of specialists who jointly perform certain types of jobs (consulting services, compliance assessment for products, goods or services according to given requirements etc.). The team performing this work is composed of a set of specialists of various types (specialties), and their total number is limited. The problem is to design a team work plan for which the time to complete all jobs is minimal. We reduce this task to a linear programming problem and also consider heuristic algorithms and special cases of the problem.
Similar content being viewed by others
References
Burkov, V.N., Resource Allocation as a Problem of Optimal Rapidity, Autom. Remote Control, 1966, vol. 27, no. 7, pp. 1251–1260.
Burkov, V.N., Problems of Optimum Distribution of Resources, Control Cybern., 1972, vol. 1, no. 1–2, pp. 27–41.
Chudrov, V.I., Zadacha o kommivoyazhere (The Travelling Salesman Problem), Moscow: Znanie, 1969.
Barkalov, S.A., Voropaev, V.I., and Sekletova, G.I., Matematicheskie osnovy upravleniya proektami (Mathematical Foundations of Project Management), Burkov, V.N., Ed., Moscow: Vysshaya Shkola, 2005.
Author information
Authors and Affiliations
Corresponding author
Additional information
Russian Text © V.N. Burkov, L.V. Rossikhina, A.P. Vyunov, L.V. Rogovaya, 2019, published in Avtomatika i Telemekhanika, 2019, No. 1, pp. 116–125.
Rights and permissions
About this article
Cite this article
Burkov, V.N., Rossikhina, L.V., Vyunov, A.P. et al. The Optimal Distribution Problem for Teams of Specialists. Autom Remote Control 80, 93–101 (2019). https://doi.org/10.1134/S0005117919010089
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117919010089