Properties of graphs of problems network planning and management

Properties of a task graph of an optimum investment are considered the additional limited resource for reduction of a critical way of the network project at non-uniform marking change of arches graph of the project. The algorithm construction of the count of the project on the set matrix of precedence of works is offered. The algorithm reduction lists of technological precedence of works of the project to lists of direct precedence by correct ordering is developed. Examples of addition fictitious works are resulted and reception minimization of necessary number of fictitious works for simplification of the count the project is specified. It is shown that, on an extreme measure, with addition of fictitious works, columns of the project it will be constructed.

problems of network planning and management, lists of predecessors, graph of the project, minimization of the required number of dummy jobs