Documente Academic
Documente Profesional
Documente Cultură
Pertemuan 5
Perencanaan Proyek :
Identifies activities that control the project length Determines shortest time for completion Identifies activities that are critical (i.e. cannot be delayed) Shows available float for non-critical activities Allows evaluation of what-if scenarios Allows monitoring & control of fast-track projects With software can be resource loaded and leveled
Only as good as the effort put forth to properly model the plan Can be difficult to properly update Can be easily misused May lead to a false sense of security Actual conditions may necessitate significant modifications to model to accurately reflect reality
FS FF SS SF
descriptions Nodes representing the activity Arrows representing relationship / dependency Points indicating direction of relationship / dependency
Start to Finish (SF) Activity A must start before Activity B may Finish. The lag is usually greater than either activity duration. FS is the least common type. Activity A Activity B
Start to Start (SS) Activity A must Start before Activity B may Start. The lag value is usually greater than zero. SS is a less common type. Activity A Activity B
Once the Network is constructed and duration of each activity is estimated, we can determined the following four time values:
Earliest Start (ES) The earliest possible time an activity can begin Earliest Finish (EF) The earliest possible time an activity can finish Latest Start (LS) The latest possible time an activity can start without delaying project completion Latest Finish (LF) The latest possible time an activity can start without delaying project completion
ES and EF are determined by making a Forward Pass (left-to-right) through the Network. ES of an activity is equal to the latest of early finish times of its predecessors. EF is the total of the activity ES plus its duration. LS and LF are determined by making a Backward Pass (right-to-left) through the Network. LF of an activity is equal to the smallest of the LS times of the activities exiting from the activity in question. LS of an activity is equal to its LF minus its duration.
Lag
on the morning of the scheduled start date End the evening of the scheduled finish date Using a 7-day workdays per week calendar
D 4 E 1 F 7
2
8 0 0 12 G 7 18
Largest ES
10
(H to K) 25 - 2 - 1 = 22 (I to K) 24 - 0 - 1 = 23 (J to K) 34 - 0 - 1 = 33
A 6d
B 11d
C 20d
H 20d
J 20d
D 13d
E 9d
F 20d
G 6d
I 13d
J 1d 20d 20d
E 34d 9d 42d
G 34d 6d 39d
Additional Network calculations provides other important information allowing analysis and control:
Total Float (TF) The amount of time an activity can be delayed without delaying the overall project completion, which is equal to Late Finish minus Early Finish. Free Float (FF) The amount of time an activity can be delayed without delaying the start of another activity. Can be determine by subtracting the smallest Total Float going into an activity from each predecessor into that activity. Critical Path The path through the Network that has the longest total duration, thus it defines the shortest period of time in which the project may be completed.
SEKIAN
23