3 project network example (AON) Basic Scheduling with AON Networks

NETWORK TECHNIQUES Basic Scheduling with A-O-N Networ ks ALTERNATIVE PROJECT REPRESENTATIONS Activity on Arc Activity on Node (A-O-A) Arrow Diagrams Event Oriented (A-O-N) Precedence Networks Activity Oriented Network Networks Activity, a i i i EXAMPLE – (A-O-N) JOB PREDECESSORS DURATIONS (Days) A - B - C a D a,b E d F d G c,e H c,e I f,g,h Project Network Example-1 (A-O-N) cc aa g d e h b f i FORWARD PASS FOR EXAMPLE-1 BACKWARD PASS FOR EXAMPLE-1 EARLY & LATE SCHEDULE FOR EXAMPLE-1 Job Duration ES EF LS LF TF a 2 b 3 c 11 12 d 7 e 12 12 f 15 10 18 g 12 18 12 18 h 12 16 14 18 i 18 21 18 21 CRITICAL PATH FOR EXAMPLE-1 CRITICAL PATH FOR EXAMPLE-1 FLOATS FOR EXAMPLE Job Total Safety Free Independent a 1 0 b 0 0 c 9 d 0 0 e 0 0 f 3 3 g 0 0 h 2 0 i 0 0 FLOAT COMPUTATIONS FOR ACTIVITY a Total Float = LS-ES = LF – EF = Safety float = Total Float – {(Max(LF of predecessors) – ES)} = Free Float I – (0-0) = I = Total Float – {( LF – Min( ES of successors)} = I –(0-0) = Independent float = Total float – both the latter terms = I- (0+1) = FLOAT COMPUTATIONS FOR ACTIVITY c Total Float = LS-ES = LF – EF = Safety float = Total Float – {(Max(LF of predecessors) – ES)} = Free Float = Total Float – {( LF – Min( ES of successors)} = – Independent float = Total float –both the latter terms = 9-(1+0)= – (3-2) = (12-12) = PRECEDENCE DIAGRAMMING METHODS  Generalized precedence relations  Start to Start (SS)  Finish to Finish (FF)  Start to Finish (SF)  Finish to Start (FS)  Permit partial or complete overlap of activities START TO START LAG (SS) FINISH TO FINISH LAG (FF) START TO FINISH LAG (SF) FINISH TO START LAG (FS) Thank you