Use the critical path method to find the early and late start and finish times as follows:
Forward Pass:
ES of the starting activities = 0
ES of all other activities = Max. (EF of their immediate
predecessors)
EF of an activity = Its ES + Its duration
Backward Pass:
LF of ending activities = Max. (All the EFs)
LF of all other activities = Min. (LS of their immediate
successors)
LS of an activity = Its LF - Its duration
Total slack (or, float) = LF - EF for each activity.
Activity | Duration | ES | EF | LS | LF | Slack |
A | 5 | 0 | 5 | 0 | 5 | 0 |
B | 3 | 5 | 8 | 9 | 12 | 4 |
C | 7 | 5 | 12 | 5 | 12 | 0 |
D | 6 | 12 | 18 | 12 | 18 | 0 |
E | 2 | 8 | 10 | 16 | 18 | 8 |
F | 3 | 12 | 15 | 15 | 18 | 3 |
G | 4 | 18 | 22 | 18 | 22 | 0 |
H | 5 | 22 | 27 | 22 | 27 | 0 |
(a)
The project competition time = LF of the finishing activity 'H' = 27
(b)
The critical path of a project is composed of activities with zero total slack. So, it's A-C-D-G-H.
(c)
Already there in the table.
2- Consider the AON network illustrated below: B G H A F Activity A B с...
2- Consider the AON network illustrated below: M E H Activity А B с D E F Duration 5 3 7 2 3 4 5 H a) Calculate the project completion time b) What is the critical path? c) Calculate the slack time for each activity.
activity immediate processor activity time (days) A - 6 B - 8 C A,B 5 D B 4 E C 7 F C,D 3 G D 6 H E,F,G 5 Given the following information for a project. SHOW ALL WORK. a) Draw the AON(Activity-On-Node) project network b) Write the estimated slack times for activities A-H c) Identify the critical path d) Determine the total completion time of the project.
Q4 The network diagram of a project is shown below E.4 B.3 G.5 D.5 A.7 F.2 C.4 (a) Use two-pass method to determine the critical path. (3 points) (b) What is the project duration? ( points) (c) What is the slack time of activity F? ( points) Q4 The network diagram of a project is shown below E.4 B.3 G.5 D.5 A.7 F.2 C.4 (a) Use two-pass method to determine the critical path. (3 points) (b) What is the project...
Consider the following project activities: Calculate the expected time (te) for each activity. Draw an Activity on Node (AON) diagram to reflect the flow of these activities. Calculate the Early Start (ES), Early Finish (EF), Late Start (LS), and Late Finish (LF) for each activity. Calculate the slack for each activity. Identify all activities on the Critical Path. Use the data to calculate the probability the project will finish in 20 weeks (Hint: z-score). Activity A 8 с D E...
1. For the following schedule, Draw the AON network diagram for the project and calculate the schedule. а. Summarize the schedule in a tabular form, showing ES, EF, LS, LF, TF, and FF for each activity b. Denote the critical path on the network. C. d. Perform a cost analysis based on an early start, late start, and target schedule for the project. Plot the cumulative cost distribution for the three S-curves on one graph. e. f. Plot the cumulative...
Given the information in the following table: Activity Duration Predecessor A 4 None B 6 A C 4 A D 2 C E 4 B F 5 B, D G 3 C H 4 F, G I 2 E, H Construct the (AON) Activity on Node network diagram Find each activity’s ES, EF, LS and LS Identify all paths. Which path is the critical path? Calculate the slack for each activity. How long will it take to complete the project?
Consider the following project where times are in weeks. Activity Duration Immediate Predecessors A B с D E F G H A.B B A с E,F 8 12 7 4 2 3 7 3 DF a) Determine the activity schedule (ES, EF, LS, and LF) as well as slack using the information from the table above (11 marks) b) Determine all the possible paths of this project and determine the shortest possible time this project can be completed? (4 marks)...
QUESTION 5 Given is a CPM project network diagram as shown below. A с F Start E H End B D Start A B E H End Activity day с 7 D 3 F 5 G 6 0 2 4 3 0 a) The Project Completion time = days. b) The Earliest Start time, Es, of Activity G = days. c) The Latest Finish time, LF, of Acitivity C - days. d) The critical activities are (ex. Fill in answer...
Consider the following project network and activity times (in weeks): Start Finish Activity | A B C D E F G H Time 5 37 6 7 310 8 a. Identify the critical path. b. How much time will be needed to complete this project? c. Can activity D be delayed without delaying the entire project? If so, by how many weeks? d. Can activity C be delayed without delaying the entire project? If so, by how many weeks? What...
2. Assume you have a project with ten activities labeled A-J, as shown. Derive the earliest completion time (EF), latest completion time (LF) and slack for each of the following tasks (begin at time 0). Which tasks are on the critical path? Highlight the critical path on your network diagram [5] Activity Preceding Expected EF LF Slack Critical Event Duration Path? A 4 A 5 C A 6 A 7 E A, D 6 C, E 4 G D, E...