AbstractThe concept of the restrictiveness of project networks is defined to reflect the degree to which precedence requirements eliminate possible scheduling sequences. A suitable measure of restrictiveness is presented, as published related materials are shown not to apply. To extend the computational feasibility of the concept to larger networks, three indirect estimators of the measure are introduced. Relationships between these and related statistical properties of networks are shown. Finally, an algorithm to generate random networks with a specified restrictiveness is given.