No abstract

No abstract

No abstract

No abstract

The article focuses on the problem of algorithmizing the process of building schedules in various spheres of human activity by using the modern mathematical apparatus, as well as achievements in the field of systems analysis, game theory, and graph theory. Nowadays, there have been analyzed and determined the boundaries of the effective application of many well-known heuristic and metaheuristic algorithms, which have shown good results in practice. However, despite the achievements in the discrete optimization, scheduling and network planning, the new problems of drawing up so-called coordinated schedules in the field of multi-project planning, which take into account the preferences (requests, wishes) of specific schedule executors, are still of practical interest. There have been considered the approaches and main stages of solving the problems of constructing coordinated schedules in multi-project planning, which is relevant for the development of new generation software and tools