DETERMINATION OF OPLIMAL COMPOSITION OF EXECUTORS FOR MULTI-STAGE SEIVICE SYSTEM

The object of the research in the work is multi-stage systems, at the entrance of which comes a stream of applications that require performing a series of series-parallel works for their service. The subject of the research is the optimization of the task of assigning contractors to work in such a system. The aim of the work is to formalize the task under study, taking into account the human factor while working together with a group of performers. The study of the features of the problem showed the impossibility of using classical approaches (in particular, the Hungarian method and methods for solving problems of integer programming) to solve it. In this regard, it became necessary to develop their own specialized mathematical and algorithmic apparatus. As a result, a formalization of the problem is proposed, including a nonlinear objective function and recursive constraints. The specificity of the mathematical apparatus required the use of appropriate algorithmic support for its solution. The method was based on a return algorithm. The general idea of the algorithm based on the branch and bound method is presented. Thus, a formal description of the task of assignments to performers, taking into account the existing features of the system, and also presents a general algorithm for solving it. Detailing and software implementation of the algorithm will improve the efficiency of management decision-making by optimizing the choice of a team of performers for each of the works.

1. Bolnokina E.V. Formalizatsiya zadachi vybora mekhanizmov stimulirovaniya v zadache organizatsionnogo upravleniya mnogostadiynoy proizvodstvennoy sistemoy/ E.V. Bolnokina, S.A. Oleynikova // Sistemy upravleniya i informatsionnye tekhnologii, No. 4(74), 2018. – pp. 26-29.

2. Vatutin E.I., Titov V.S., Emel'yanov S.G. Osnovy diskretnoy kombinatornoy optimizatsii. M.: Argamak- Media, 2016. – 270 p.

3. Takha Kh. A. Vvedenie v issledovanie operatsiy, 7 izdanie.: Per. s angl. – M.: «Vil'yams», 2005. – 912 p.

4. Cohen R., Katzir L., Raz D. An Efficient Approximation for the Generalized Assignment Problem // Information Processing Letters. Vol. 100 Issue 4. 2006. – pp.162-166.

5. D. B. Shmoys and Eva Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62(3) 1993. – pp. 461-474.