The policy of maintenance support of a complicated engineering system, providing the maximum effectiveness of its service, is considered. The solved optimization problem of integer programming allows combining the structural elements of a project into groups, optimal from the position of minimization of inter-group connections.
This article focuses on a sequencing approach for the night arrangement of subway trains compositions. In this paper, we developed an algorithm for transforming the adjacency matrix of a simple graph into the adjacency matrix of a "dense" graph.
In this article some questions of technical systems scheduling and maintenance are considered on example vehicles. From one side, the scheduling has to satisfy the requirements of safety and be the effective for equability criterion, from another side. The mathematical apparatus, used in the article, bases on the combinatory and graph theory.