ABSTRACTS OF ARTICLES OF THE JOURNAL "INFORMATION TECHNOLOGIES".
No. 11. Vol. 25. 2019

DOI: 10.17587/it.25.650-657

A. D. Tsvirkun, Head the Department, Chief Researcher Scientist, e-mail: tsvirkun@ipu.ru, V. V. Topka, Senior Researcher Scientist, e-mail: topka3@mail.ru, Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russian Federation

Even Allocation of Non-Renewable Resource in Large-Scale Innovative Projects

The problem of even allocation according to the minimax criterion of a non-renewable resource of an innovative project's activities is considered. A lexicographic method of ordering these minimax criteria is used. To solve the problem — one criterion — developed a greedy algorithm for finding the maximum path on an acyclic digraph with double weights on arcs. The obtained solution allows to build a project resources plan and schedule with four types of temporary slacks with inaccurate initial data. The proposed approach allows performing an analysis of the project Risk of Performance parameter, for which the apparatus for its analysis has not been developed. These include the risks that the project when complete fails to perform as intended or fails to meet the mission or business requirements that generated the justification for the project. Performance risks are based on the probability distribution function of a favorable / unfavorable outcome. For these: the probability of a project's success is the probability that a failure will not occur during the execution of this project, and the probability of failure-free execution is taken as a measure of reliability of performance. By virtue of the inequality of the problem, the consequence of the initial statement, taking into account the network specificity, we will seek solution of that problem-consequence in the form of a maximal path with double weights or an l — optimal path. The complexity of the algorithm outlined is evaluated as O[(|Ã| + D|Ã|)|Ã| + |Ã|] ~ O(|Ã|²) operations. And for a complete vertex coverage, you need to repeat this algorithm |Ã| more than once, then all O(|Ã|³) operations will be required. The general problem is solved by successive optimization of the remaining subgraph by the minimax criterion at each
stage. This procedure converges in a finite number of stages. Such lexicographic disintegration is a decomposition procedure and is suitable for planning and scheduling large-scale projects. Practical calculations for the convex problem in the initial statement have been performed with the help of ready-made software, and the obtained greedy solution of the problem-consequence has theoretical significance in graph theory.
Keywords: large-scale innovation project, even allocation of resource, risk of performance, reliability index of the project's activities, concave reliability function, inaccurate schedule, inaccurate slacks, greedy algorithm, maximum path with double weights on arcs

To the contents