UDC 681.3

D.E. Orlova,V.A. Chertov, S.I. Sigarev, S.S. Kochedykov

The article solves the problem of developing two coordination algorithms for managing large-scale projects. The first algorithm is designed to select the appropriate method of coordination when managing the projects under consideration. The algorithm is based on the thesis that the higher the threat of failure of the project plan, the higher the degree of centralization of project management should be, and the lower the threat, the less centralized the project management should be. With this approach, choosing the appropriate method of coordination actually comes down to assessing the threat level. Given that the concept of “level” is of a qualitative nature, it is proposed to characterize it by the function of belonging to gradations: “very high”, “high”, “medium”,” low”, and” zero”, and to evaluate the current threat level, use the measure of hemming proximity, which uses the zero threat level as a reference. The second algorithm is designed to select optimal coordinating solutions based on the criterion of minimum deviation of the project from the specified target state. Its novelty and originality lies in the fact that, unlike the usual optimization approach, it is built on a combination of methods of full iteration and linear programming. This made it possible to correctly take into account the fact that coordinating and design solutions are inextricably linked with each other.

Keywords:project, coordination, project Manager, project performer, membership function, algorithm

Full text: