Академический Документы
Профессиональный Документы
Культура Документы
Scheduling Methods
Work Breakdown Structure Bar Chart Basic Networks Critical Path Method (CPM) Program Evaluation and Review Technique (PERT)
Page 1
Scheduling
It is the process of fitting the work plan to a time frame. The activities are sometimes interdependent or independent. For example, Roof slab casting can't take place unless the reinforcement has been placed in position and reinforcement can't be placed in position until the shuttering has been completed. Like this the various inter-related activities of the project need to be studied and scheduled accordingly for the efficient functioning. The independent activities takes place irrespective of the completion or delay of the other activities. For example, reinforcement and erection of shuttering can be done independently and simultaneously. Some of the conventional methods for Scheduling explained below.
Activity
A B C D E Layout and excavation of column footings. Laying of lean concrete and curing. Fabrication of foundation reinforcement. Erection of shuttering and placing of reinforcement. Casting of column foundations.
Duration
2 days 3 days 2 days 2 days 2 days
Page 2
Bar Chart
Monitoring
Coloring and Hatching bars technique was associated with the Bar charts to check out the progress of different activities. As shown in the bar chart, the darkened (black) part of bars indicate the level of completion of the particular activity against time (in days). Let us take a particular day, say day 8 and try to find the progress of the activities. If we see, at the end of day 7 only 50 % of work is completed against the planned 70%. This review of progress would indicate an Urgency to expedite the laying of foundation concrete by including more resources to avoid delay of subsequent activities. But without this additional impovement on Bar Chart, site engineers would not know the extent of delay in planned schedule and may fail to take timely corrective measures.
Page 3
d) Quantum of work - The quantity of work to be carried out in each activity is not indicated, thus it is not easy to work out the requirement of resources for execution.
Basic Networks
Networks are logical and chronological graphic representation of the activities that constitutes a project (events composing a project). basically the networks are of two types, Arrow network and the Node network. In an arrow network the activity is mentioned over the arrow and so it is also called as Activity On Arrow (AOA) networks. In case of the node network, the activity is mentioned inside the node and so it is called AON i.e. Activity On Node. The representation of a simple AOA and AON network below gives the idea of basic networks in construction management.
The circles in the AOA and the squares in the AON network represents the nodes, the activities are represented by the alphabets and the arrow heads indicate the hierarchy of activities. The nodes represent events ; as an event is the point of time when an activity starts or ends. Each arrow connect two nodes, the from node and the to node (depicted by circles and squares in AOA and AON respectively). The basic difference between AOA and AON networks is that, in AON or node networks the dummy activities are not depicted separately.
Construction Project Management Page 4
Logic : In the above network we have, the activities B and C following after A. This means B and C can't happen when A is not completed. But in reality B and C may occur consecutively or concurrently depending upon the resources availability, site conditions etc. And once both B and C are done, activity D can start.
Dummy activities : These are fictitious activities which are inserted into arrow (AOA) networks to make it logically correct and to distinguish between identities of activities. The AOA network below will explain about
Redundancies : An important thing to note that while building a arrow network you can have not only a logically improper network but also a proper one with redundant dummy activities. This fact is especially true for complicated networks. Redundant dummy activities are not logically improper: they are just redundant ( ).
Page 5
Fig.
Float
Float is the extra time available for an activity over and above the activity duration. There are three types of floats namely Total Float (TF), Free Float (FF) and Independent Float (IF). (a) Total Float (TF) :- It is the maximum time by which an activity can be delayed without delaying the completion time of Project. Total Float of an activity is related to all other activities and use of Total float will affect the floats of both preceding and succeeding activities. Total Float (TF) = Total time available to execute activity - duration of activity. TF = (TLh - TEt) - d (b) Free Float (FF) :- If we don't wish to interfere with the floats of succeeding activities the activity must finish at the earliest event time of head event so that succeeding activity can start at its EST (Earliest Start Time of an activity), therefore FF = (TEh - TEt) - d
Page 7
(c) Independent Float (IF) :- This is the real reserve of the activity because by using IF we will not be interfering either with the preeding or succeeding activity and for this to happen activity should start at latest start time of tail event and finish at the earliest event time of head event. IF = (TEh - TLt - d)
Critical Activities
The activities of a project can be grouped into two groups i.e. Non Critical activities and Critical activities. Non Critical activities are those activities for which Total float is not zero and Critical activities are those for which the Total float is zero. As there is zero Total float in Critical activities, any delay in their completion will cause corresponding delay in the project completion time.
Critical Path
The path joining the critical activities in a network is known as Critical Path. It is the longest path in the network and the time taken on this path determines the completion time of project. To locate critical path total float in respect of all activities is worked out and critical activities (TF = 0) are identified and joined together to identify the critical path. Double or Bold lines are used to mark the critical path in network so that it is prominently visible. A network may have more than one critical path. The network below will explain the Critical path method of Scheduling. Consider the activity table and the corresponding AON network. Activity A B C D E F G The Forward Pass The project starts with activity A, which starts at the beginning of day 1 (end of day 0). It takes 5 days to finish activity A: it finishes on day 5 (end of the day). At this point, activities B and C can start. Activity B takes 8 days: it can start on day 5 (directly after activity A finishes), so it can finish as early as day 13. Similarly, activity C can finish on day 11 (5 + 6). Activity D follows activity B. It can start on day 13 (end of B) and end on day 22. Activity E must wait till both activities B and C are finished. Activity C finishes on day 11, but activity B does not finish till day 13. Thus, activity E cannot start till day 13. with 6 days' duration, activity E can then finish on day 19. Activity F depends on activity C only. Thus, it can start on day 11 and finish on day 14. The last activity, G, cannot start till activities D, E, and F are finished. Through simple
Construction Project Management Page 8
observation, we can see that activity G cannot start till day 22 (when the last activity of D, E, and F finishes). Activity G takes 1 day, so it can finish on day 23. The Completed network is shown below.
For this example, we have calculated two types of dates: 1. The expected completion date of the project: day 23 2. The earliest date when each activity can start and finish These dates are called the early start (ES) and the early finish (EF) dates for each activity. As you will soon learn, an activity cannot start earlier than its ES date and cannot finish earlier than its EF date, but it may start or finish later than these dates. In mathematical terms, the ES time for activity j (ESj) is as follows: ESj=max(EFj) where (EF1) represents the EF times for all immediately preceding activities. Likewise, the EF time for activity j (E15) is as follows: EF=ESj+Durj where Dur is the duration of activity j. The forward pass is defined as the process of navigating through a network from start to finish and calculating the early dates for each activity and the completion date of the project. See Figure \ The Backward Pass Now let us start from the end of the project and work our way back to the start. we already know the end-of-project date5: day 23. Activity G must finish by day 23. Its duration is only 1 day, so it must start no later than day 22(23 - 1) so that it does not delay the project. Similarly, activities D, E, and F must finish no later than day 22 so that they will not delay activity G. Through simple computations, we can find their late start dates: activity F: 22-3 =19; activity E: 22 - 6 = 16: and activity D: 22- 9 =13. Activity C must
Construction Project Management Page 9
finish before activities E and F can start. Their late start dates are 16 and 19, respectively. Clearly, activity C must finish by the earlier of the two dates, day 16, so that it will not delay the start of activity E. Thus, its late start date is day 10 (16 - 6). Similarly, activity B must finish by the earlier of its successors' late start dates: day 13 for D and day 16 for E. Therefore, the late finish date for activity B is day 13 and its late start date is day 5(13 - 8). The last activity (from the start) is A: It must finish by the earlier of the late start dates for activities B and C, which are day 5 for B and day 10 for C. Consequently, the late finish date for activity A is day 5, and its late start date is day 0 (5 - 5). In mathematical terms, the late finish (LF) time for activity j(LSj) is as follows: LF=min(LSk) where (LSk) represents the late start times for all succeeding activities. Likewise, the late start (LS) time for activity j (LSj) is as follows: LSj=LFjDurj The backward pass is defined as the process of navigating through a network from finish to start and calculating the late dates for all activities. This pass, along with the forward-pass calculations, helps identify the critical path and the float for all activities. If you refer to Figure , you can see that for some activities (light lines), the late dates (shown under the boxes) are larger (i.e., later) than their early dates (shown above the boxes). For other activities (thick lines) late and early dates are the same. For the second group, we can tell that these activities have strict start and finish dates. Any delay in them will result in a delay in the entire project. We call these activities critical activities. We call the continuous chain of critical activities from the start to the end of the project the critical path. Other activities have some leeway. For example, activity C can start on day 5, 6, 7, 8, 9, or 10 without delaying the entire project. As mentioned previously, we call this leeway float. There are several types of float. The simplest and most important type of float is total float (TF): TF = LS - ES (or) TF = LF - EF (or) TF = LF - Dur - ES With the completion of the backward pass, we have calculated the late dates for all activities. With both passes completed, the critical path is now defined and the amount of float for each activity is calculated.
Activity
A
B C D E F G
Duration 5 8 6 9 6 3 1
ES 0 5 5 13 13 11 22
EF 5 13 11 22 19 14 23
LS 0 5 10 13 16 19 22
LF 5 13 16 22 22 22 23
TF 0 0 5 0 3 8 0
Page 10
Concept of PERT
Like the regular (deterministic) CPM, PERT uses logic networks to calculate the completion date of a project or the date of any other event in the schedule. In PERT, a probability (likelihood) is associated with any event date. This probability depends on uncertainty in the durations of the activities that lead to the desired event (e.g., project completion). PERT realizes that actual durations vary from those assigned, so it attempts to compensate for this variation with a time range during which activity durations may realistically occur. This topic is discussed in more detail after the details of PERT are covered. Working Of PERT PERT uses a probabilistic approach, which requires a duration frequency distribution for each activity. In most cases, such distributions are unknown or unavailable. Because of this, PERT requires the user to set three durations that constitute the practical range of the duration for each activity. These three
Construction Project Management Page 11
durations give a distribution for the activity, and we can produce the statistical mean and variance for the duration of the activity. When we need to compute the probability that a certain event, such as Substantial Completion of a building, will occur by a certain date, we need to take into account all preceding events, starting at the beginning of the project and including the continuous chain of activities till Substantial Completion. Using the central limit theorem, PERT treats the means of the durations of these activities as a normal distribution, no matter what distributions these durations followed. PERT then uses simple statistics to calculate the mean and variance (or standard deviation) of the time required to complete the chain of events leading to Substantial Completion. It calculates the probability that Substantial Completion will occur by a particular date, or, conversely, it calculates the date that the Substantial Completion event will happen with a certain level of confidence (probability). PERT Calculations As mentioned previously, the path (chain of activities or events) leading to the examined event (e.g., Substantial Completion) must be chosen. For each activity on that path, three durations must be estimated: To: Optimistic Duration Tm: Most Likely Duration Tp: Pessimistic Duration The preceding values are estimated by the scheduler or project manager, who uses his or her experience and good judgment to do so. The optimistic duration is the amount of time the activity will take if everything goes smoothly and efficiently. The pessimistic duration is the duration under the worst-case scenario. Both values must be within the realistic, although perhaps unlikely, realm of expectations. The mean weighted value for these three durations is called the expected duration (Te). It is calculated as follows:
Te = To + 4Tm + Tp 6 The weights assigned to these times (coefficients of To, Tm, and Tp) may be adjusted, but the denominator must equal the sum of all weights. The weights in equation above represent a population of durations made up of 16.7% (one-sixth) optimistic (To); 66.7% (four-sixths) most likely (Tm); and 16.7% (one-sixth) pessimistic (Tp). Most likely Duration (Tp) is the time for completion of an activity under normal conditions i.e. conditions are not ideal, minor mishaps may happen.
Applications of PERT
PERT is used for works which are first of its kind, where time estimates for various activities are neither known nor can be estimated with any certainty. The emphasis is given on reducing project completion time without cost constraints.
Page 12
Page 13