1. Scheduling Computations for Precedence Networks

2. Prof. Awad Hanna Tabular Format (Precedence Diagram)  Can be carried out on the tabular form without reference to the diagram.  Advantage: the time required to construct the diagram is eliminated.

3. Prof. Awad Hanna Link Lag A link lag is the difference between the early start date of an activity and the early finish date of the preceding activity LAG ij = ESD j - EFD i

4. Prof. Awad Hanna Determining log Examples: LAG 5-10 = ESD 10 - EFD 5 =4 - f 4 = 0 LAG 15-25 = ESD 25 - EFD 15 =12 - 7 = 5 LAG 20-25 = ESD 25 - EFD 20 =12 - 6 = 6

5. Prof. Awad Hanna Determining the Free-Float  Free Float is the minimum of the log of the link that follow an activity.  Look at the “Pre. column” to find the same number value of EF for terminal activity “not following act.” FF i = Min  j - LAG ij FF 35 = LFD 35 - EFD 35 = 20 - 20 = 0

6. Prof. Awad Hanna Determining the Total Float “Backward” TF i = Min (log ij + TF j )  Take TF of the terminal activity = 0 or TF 35 = LFD 35 - EFD 35 = 20 - 20 = 0

7. Prof. Awad Hanna TF 30 = Min (log 30-35 + TF 35 ) = Min ( 7 + 0 ) = 7 No other link TF 20 = Min LAG 20-25 + TF 25 = Min 6+0 = 6 LAG 20-30 + TF 30 1+7 { } {} Determining the Total Float “Backward” (cont.)

8. Prof. Awad Hanna INTF Float  INTF = TF - FF

9. Prof. Awad Hanna  If the free float is zero - no INDF INDF j = FF j - Max _ I ( TF I - LAG IJ ) INDF 20 = FF 20 - Max ( TF 5 - LAG 5-20 ) = 1- (0 -0 )=1 INDF 30 = FF 30 - Max TF 15 - LAG 15-30 TF 20 - LAG 20-30 = 7 - 5 - 0 = 2 6 - 1 {} { }

10. Prof. Awad Hanna Float Determination - Sample Precedence Network

11. Prof. Awad Hanna Late Date Determination - Sample Precedence Network

12. Prof. Awad Hanna Lag Determination - Sample Precedence Network