CNST 361 ch8 - Page 177 - The following info pertains to...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CNST 361 2-12-08 Chapter 8 - Schedule calculations Network schedule calculations After the project network has been developed, calculations can be made. These are important to determine the following for each activity: Early start Late start Early finish Late finish These are done by the “forward pass” and “backward pass” methods. In the forward pass, the following are determined: The earliest time (day) each activity in the network can start and finish The minimum overall duration (days) of the project According to the precedence concept, the earliest any activity can start is when all predecessors to that activity are completed. Also, each activity is assumed to finish as-soon-as-possible — based on its assigned start date and its calculated duration.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Page 177 - The following info pertains to the next day scheduling convention which differs from what is presented in the text. This convention states that an activity will take-up an entire day to complete Page 78 from the textbook IDs the same day convention which does not translate well to computer scheduling software. The early start date for any activity is the maximum early finish ES act = EF prev + 1 Ef act = ES act + DUR - 1 The minimum overall project duration is determined by the early finish time of the last activity in the network. This is a key calculation of the project network, and is often tied into the project contract completion date....
View Full Document

This note was uploaded on 04/01/2008 for the course CNST 361 taught by Professor Scigliano during the Winter '08 term at Eastern Michigan University.

Ask a homework question - tutors are online