Project networks are used to plan, schedule and monitor project progressDepicts the project activities to be completed, sequences, interdependencies, time taken and critical pathBuild from work package into network

DEVELOPING THE PROJECT NETWORK

Developing the Project PlanThe Project NetworkA flow chart that graphically depicts the sequence, interdependencies, and start and finish times of the project job plan of activities that is the critical path through the network.Provides the basis for scheduling labor and equipment.Enhances communication among project participants.Provides an estimate of the projects duration.Provides a basis for budgeting cash flow.Identifies activities that are critical.Highlights activities that are critical and can not be delayed.Help managers get and stay on plan.

CONSTRUCTING A PROJECT NETWORKTERMINOLOGY:Activity what has to be completed to complete the projectMerge activity more than two activities preceding itParallel activities occur at the same time if need.Path sequence of connected dependent activitiesCritical path longest path on the networkEvent point in time when an activity is started or completedBurst activity more than one activity immediately following it

CONSTRUCTING A PROJECT NETWORKACTIVITY ON NODE VS ACTIVITY ON ARROW RULES:Networks flow from left to rightAll preceding activities must be completedArrows indicate precedence and flowEach activity must be numberedAny activity id number must larger than preceding numbersLooping is not allowedHave a clear start and end

NETWORK COMPUTATION PROCESSFORWARD PASS (EARLIEST TIMES)ES HOW SOON CAN THE ACTIVITY STARTEF HOW SOON CAN THE ACTIVITY FINISHTE HOW SOON CAN THE PROJECT FINISHES+duration = EFEF then carried forward to be ES for next activity unless the next activity is a merge activity in which case you use the biggest preceding EFBACKWARD PASS (LATEST TIMES)LS HOW LATE CAN THE ACTIVITY STARTLF HOW LATE CAN THE ACTIVITY FINISHCP CRITICAL PATH (LONGEST PATH WHICH WHEN DELAYED WILL DELAY THE WHOLE PROJECT)SL SLACK OR FLOAT (HOW LONG CAN THE ACTIVITY BE DELAYED)

NETWORK COMPUTATION PROCESSLF DUR = LS (IN EARLY STAGES, LF FOR THE LAST PROJECT = TE)LS then carried backward to be LF for next activity unless the preceding activity is a burst activity in which case you use the smallest successor LSSL = LS-ES/LF-EF = THE TIME AN ACTIVITY CAN BE DELAYED AND YET NOT DELAY THE PROJECTCP = THE NETWORK PATH THAT HAS THE LEAST SLACK IN COMMON: IF LF=EF THAN SLACK = 0.FREE SLACK ACTIVITY CAN BE DELAYED WITHOUT DELAYING THE ES OF THE NEXT ACTIVITYFSL = ES(S)-EF(P); ONLY ACTIVITIES AT THE END OF A CHAIN CAN HAVE FREE SLACK