| Article ID: | iaor19951121 |
| Country: | Australia |
| Volume: | 13 |
| Issue: | 1 |
| Start Page Number: | 8 |
| End Page Number: | 13 |
| Publication Date: | Mar 1994 |
| Journal: | ASOR Bulletin |
| Authors: | Sniedovich Moshe, Beaumont Nick |
| Keywords: | networks: scheduling, computational analysis: personal computers |
This article argues that modelling a critical path by placing the activities onthe nodes of a network is distinctly easier than modelling by placing the activities on the arcs. The authors note that the latter method is much more frequently taught. APL2 code is used to provide user friendly software which implements an ‘activity on node’ algorithm. In particular, a Gantt chart is output.