Coefficient of Network Complexity

Richard A. Kaimann
Additional contact information
Richard A. Kaimann: Marquette University

Management Science, 1974, vol. 21, issue 2, 172-177

Abstract: The degree of complexity of a critical path network may be classified by calculating a Coefficient of Network Complexity. It is defined as the quotient of activities squared divided by events or preceding work items squared divided by work items. Three distinct contributions are offered. First, the CNC may serve as an indicator of the attention spent in planning the project. Second, the CNC may be used to derive a predictor of network computer processing time. Third, the CNC value suggests the appropriate processing scheme.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.2.172 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:21:y:1974:i:2:p:172-177

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().