The problem of allocating limited capacities among activities of the set of networks is studied. This allocation must be optimal in a certain sense (e.g. minimizing duration of projects involved) and subject to the usual constraints. Different approaches to the problem are considered: from the point of view of mathematical programming and that of dynamic programming. But the problem in its general case has no way to exact solution and is to be dealt with heuristic methods. Five main principles are formulated and explained which form the basis for these methods. Different algorithms are analysed in their relations to those principles. The author proposes to build a hierarchy of algorithms on the common basis of one system of standard procedures adjusted to the problem in question. The hierarchy is to be designed to solve more common cases of the problem with simpler means and to add to those moans more complicated rules for treating less common cases containing more rare elements.