GRAPHS WITH RESTRICTIONS ON THE REACHAILITY AND THEIR APPLICATION TO OPTIMIZATION OF TECHNOLOGICAL PROCESSES
Defined two types of restrictions on the reachability graph vertices (the ability to connect one of the vertices in the other on the path): vertex-mixed reachability and vertex barrier reachability. In the case of a mixed vertex reachability graph is a distinguished subset of vertices for which the path cannot pass a certain number of consecutive once. Barrier reachability suggests that the graph selected two subsets of vertices. Vertices of the first subset increases the energy level of the moving object on the way, and vertices of the second subset can be taken only under the condition that the energy index reached a certain level. Shows how these kinds of restrictions on the reachability, defined in terms of the vertices of the graph to bring to these types of restrictions on the arcs of the graph. The problem of finding an optimal execution path of technology process in the presence of restrictions on the sequence of individual operations is discussed.