Modeling of the process of resource allocation between digital software technologies

Abstract

Resource distribution amongst digital software technology systems is a tough operation that demands high effectiveness and a significant amount of time, especially because it is a dynamic activity with basic factors that vary over time. In this article, we highlight three different situations in the technology sector. Firstly, the role of using the dynamic programming approach to construct a model that helps find the maximum profit value for digital software technology subsystems by choosing the optimal sequence of control distribution of resources between these subsystems. Secondly, constructing the optimal order for digital software technology project execution to find minimal waiting time using the compromise solution algorithm. Thirdly, the role of the optimal assignment method in finding a compromise solution is that it determines the "fairest" strategy for assignment in the sense that it minimizes the loss to the owner, who has the maximum loss in profit. The assignment methodology finds the optimal software teams for digital software technology system projects, where each software team is qualified for a digital software technology system project, taking other participants’ choices into account, to achieve the maximum profit. The dynamic programming methods considered here can be useful for planning and allocating resources between the enterprises of the agro-industrial complex.