RESOURCE ALLOCATION MODELS IN HIERARCHICAL MANAGEMENT SYSTEMS
The article proposes a mathematical model of the hierarchical system of volume-dynamic resource allocation. The model describes resource consumption processes in multi-layered systems and allows us to view the management of such systems from a single perspective, to reflect the interrelationship of decisions formed at different levels of the hierarchy.
According to the proposed model, a production (or business) system is considered as a large dynamic resource allocation system that is characterized by the interaction of three components: processes, resources, and time (R, P, and T.). Each of these components is represented by many lower-level elements with a defined ratio of a partial order, which sets the structure of the corresponding systems. The article proposes the way of description and features of the system of resources, processes and time, rules of aggregation, and disaggregation taking into account the structure of R, P, and T systems.
On the basis of the described models, a description of the production system at the lower level in the form of a binary function π0 , as well as procedures for the formation of appropriate descriptions for arbitrary levels of the hierarchy in the form of a set of tetra relations πi. An algorithm for the formation of the solution π0 , as well as procedures for its transformation to the model of an arbitrary level, is proposed.
The use of formal methods to describe the procedures of resource allocation at different levels of the hierarchy allows building a single database, to develop a structured and compact system of requests for information in the formation of management decisions.
In such a system, data for processing queries are represented by a tuple of three elements Kin (levels of input aggregation by process and time resources), the basic solution πб, a set of elements R, P, T of the corresponding level, a tuple Kout (three levels of output aggregation).
Depending on the Kin and Kout, values, the system handles the πб base solution using either aggregation or disaggregation procedures, resulting in a final result.
Vitlinsky, V. V., Tereshchenko, T. O., & Savina, S. S. (2016). Economic–mathematical methods and models: optimization: textbook. manual. K.: KNEU, 303.
Malyarets, L. M., Misyura, E. Yu, & Koibichuk, V. V. (2016). Mathematical methods and models in the management of eco-nomic processes: monograph. Kharkov: KhNEU, 420.
Vasilenko, V. A. (2003) Theory and practice of management decision making: A textbook for universities. Kiev: TsUL, 419.
Gangori, V. V. (1982) Decomposition, aggregation and ap-proximate optimization. M.: Binom, 344.
Gary, M., & Johnson, D. (1982) Computing Machines and Difficult Solvers. M. Mir, 146.
The authors who publish in this collection agree with the following terms:
• The authors reserve the right to authorship of their work and give the magazine the right to first publish this work under the terms of license CC BY-NC-ND 4.0 (with the Designation of Authorship - Non-Commercial - Without Derivatives 4.0 International), which allows others to freely distribute the published work with a mandatory reference to the authors of the original work and the first publication of the work in this magazine.
• Authors have the right to make independent extra-exclusive work agreements in the form in which they were published by this magazine (for example, posting work in an electronic repository of an institution or publishing as part of a monograph), provided that the link to the first publication of the work in this journal is maintained. .
• Journal policy allows and encourages the publication of manuscripts on the Internet (for example, in institutions' repositories or on personal websites), both before the publication of this manuscript and during its editorial work, as it contributes to the emergence of productive scientific discussion and positively affects the efficiency and dynamics of the citation of the published work (see The Effect of Open Access).