The well-orderings in a network are valued with the critical duration of the associated well-ordered network and are interprated as the nodes of a graph. The edgos of this graph are introduced by a suitably defined neighbouring relation of well-orderings. It is shown, that the nodes of minimal valuation may be determined in this struetural graph by means of a descent procedure. The valuation behaves like a quasi-convex function over a convex region of the Rⁿ; corresponding notions are transfered. These studies complete the theory of networks, they have, however, no influence to practical scheduling. They, on the other hand, prepare methods to try to get practicable algorithms for scheduling with resource restrictions.