SEARCH OF A MINIMUM CUT OF THE NETWORK SCHEDULE BY MERGING VERTICES
The essence of determining the minimum cut of the network model by merging vertices (edge tightening) of the critical network is presented. Examples of calculation of local minimum of the critical sections of the network using this method and a global minimum cut. It is found that the correctness of determining the global minimum cut significantly depends on the selected sequence of merging vertices. Implementation of the proposed approaches will allow to determining the operation to be optimized, calculate the amount of shortening and the number of resources involved.