ms·1974년 10월 1일
Coefficient of Network Complexity
Management Science
61
피인용
0.8
FWCI
1
IS/마케팅/OM 탑저널 피인용
7
IS/마케팅/OM 탑저널 참고문헌
- 주제네트워크 흐름 최적화 · 생산·최적화
01Abstract
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.
02연구 흐름
불러오는 중…
03비슷한 논문
불러오는 중…
04이후 연구
불러오는 중…
05선행 연구
불러오는 중…
06서지 정보
- 저널Management Science · 21(2) · 172–177
- 토픽Resource-Constrained Project Scheduling · Management Science and Operations Research
- DOI10.1287/mnsc.21.2.172
- 저자Richard A. Kaimann