LUNAR EXPEDITION PLAN

*SJffi
c and sequence of events are Bbow by connecting lines. The line
between the events represents work that must be done to proceed
from one event to the next (See Figure 6-U). 5he computer then
totals all of the expected activity times along every possible
(in the thousands) route of the netvork from start to the end event.
Die rep computer then examines the total times of the large number
of paths in order to find the longest nhich ifi called the critical
path. The critical path defines the sequence of events which vill
require the greatest expected tine to accomplish the end event.
•3K effects 01 a delay for any particular milestone or event
an the entire program or on any other event can be quickly and
efficiently determined so that corrective action can be taken if
required.
6.9 HDLAR-S-1*58
Tth cammant tonMlM infotMallea sHattim th* RtfftMl oafroa af tka ItalMd Statai wlthla tH innantna of HM lipionaf. Lam, rnl*
II. U.S.C, tertian 793 and 7*4, Hm HtomHtlm ar iwrietla* ef vaidi in any manna, to an •noaHiariml panan Ii Biaklbirad by law.