Premium
Measures of the restrictiveness of project networks
Author(s) -
Thesen A.
Publication year - 1977
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230070302
Subject(s) - restrictiveness , measure (data warehouse) , estimator , computer science , scheduling (production processes) , mathematical optimization , theoretical computer science , mathematics , statistics , data mining , philosophy , linguistics
The 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.