Basic Scheduling with A-O-N Networks NETWORK TECHNIQUES... ALTERNATIVE PROJECT REPRESENTATIONS Activity on Arc Activity on Node A-O- A A-O- N Arrow Diagrams Precedence Networks Even
Trang 1Basic Scheduling
with A-O-N Networks
NETWORK TECHNIQUES
Trang 2ALTERNATIVE PROJECT
REPRESENTATIONS
Activity on Arc Activity on Node
(A-O- A ) (A-O- N )
Arrow Diagrams Precedence Networks Event Oriented Activity Oriented
Activity, a
i
Trang 3EXAMPLE – 1 (A-O-N)
JOB PREDECESSOR S DURATIONS (Days)
Trang 4PROJECT NETWORK EXAMPLE-1
(A-O-N)
b
f
i
3
8
Trang 5FORWARD PASS FOR EXAMPLE-1
Trang 6BACKWARD PASS FOR EXAMPLE-1
Trang 7EARLY & LATE SCHEDULE FOR EXAMPLE-1
Trang 8CRITICAL PATH FOR EXAMPLE-1
Trang 9CRITICAL PATH FOR EXAMPLE-1
Trang 10FLOATS FOR EXAMPLE
Job Total Safety Free Independent
Trang 11Total Float = LS-ES = LF – EF = 1
Safety float = Total Float – {(Max(LF of
predecessors) – ES)}
= I – (0-0) = I
Free Float = Total Float – {( LF – Min( ES of successors)}
= I –(0-0) = 0
Independent float = Total float – both the latter terms = I- (0+1) = 0
FLOAT COMPUTATIONS FOR ACTIVITY a
Trang 12FLOAT COMPUTATIONS FOR ACTIVITY c
Total Float = LS-ES = LF – EF = 9
Safety float = Total Float – {(Max(LF of
predecessors) – ES)} = 9 – (3-2) = 8
Free Float = Total Float – {( LF – Min( ES of
successors)} = 9 – (12-12) = 9
Independent float = Total float –both the latter terms = 9-(1+0)= 8
Trang 13PRECEDENCE DIAGRAMMING
METHODS
Start to Start (SS)
Finish to Finish (FF)
Start to Finish (SF)
Finish to Start (FS)
activities
Trang 14START TO START LAG (SS)
Trang 15FINISH TO FINISH LAG (FF)
Trang 16START TO FINISH LAG (SF)
Trang 17FINISH TO START LAG (FS)
Trang 18THANK YOU