FEATURES USE THE DUAL GRAPH TO DETERMINE THE MINIMUM CUT OF THE NETWORK SCHEDULE
Set out the essence of the determination of the minimum cut of the network model by using the dual graph. Described the influence of non-planar graphs on the optimal solution. It was first established that the fictitious work, coinciding with the main direction of work should not be included in the minimum cut. Illustrated step value of «compression» of the schedule, providing the best option is a time unit. Otherwise the best option might be missed. 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.