Graphical display of critical path networks
β Scribed by J.F. Barlow
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 292 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
β¦ Synopsis
A ctivity-on-node or precedence networks are plotted by computer, using output obtained from a critical path analysis program. Three types of connections are allowed between activities, which are shown as boxes containing durations, progress, activity number, activity description, and actual start and finish dates. Options which are available include different sizes of graph-paper, extraction of sections from large networks with full facilities for interfacing with adjacent plotted sections.
π SIMILAR VOLUMES
An acyclic graph with nonnegative weights and with a unique source and destination is called an activity network. A project comprised of a set of activities and precedence relationships can be represented by an activity network and the mathematical analysis of the network can provide useful informat