From this schedule of activities:
Activity |
Immediate |
Activity Time |
A |
--- |
4 |
B |
A |
2 |
C |
B |
3 |
D |
B |
5 |
E |
A |
1 |
F |
C, D |
3 |
G |
E, F |
2 |
a. Draw the PERT/CPM
network
b. Complete the forward and backward pass
c. Determine the critical path
d. Determine the total duration of the project.
ACTIVITY |
DURATION |
ES |
EF |
LS |
LF |
SLACK |
A |
4 |
0 |
4 |
0 |
4 |
0 |
B |
2 |
4 |
6 |
4 |
6 |
0 |
C |
3 |
6 |
9 |
8 |
11 |
2 |
D |
5 |
6 |
11 |
6 |
11 |
0 |
E |
1 |
4 |
5 |
13 |
14 |
9 |
F |
3 |
11 |
14 |
11 |
14 |
0 |
G |
2 |
14 |
16 |
14 |
16 |
0 |
FORWARD PASS = ES = MAX EF OF THE PREDECESSOR
EF = ES + DURATION
BACKWARD PASS = LF = MIN LS OF ALL PREDECESSORS
LS = LF - DURATION
CRITICAL PATH = PATH WITH LONGEST DURATION AND 0 NET SLACK
CRITICAL PATH & DURATION
A + B + D + F + G = 16
From this schedule of activities: Activity Immediate Predecessor Activity Time A --- 4 B A 2...
A simple CPM network has three activities, A, B, and C. A is an immediate predecessor of B and of C. B is an immediate predecessor of C. The activity durations are A=4, B=3, C=5. The network has no critical path. The critical path cannot be determined without knowing PERT expected activity times. The critical path is A-C, duration 10.5. The critical path is A-B-C, duration 9. The critical path is A-B-C, duration 12.
Given the following activities and precedents, draw a PERT/CPM diagram. ACTIVITY IMMEDIATE PREDECESSOR DURATION (DAYS) A - 10 B - 12 C A 4 D A, B 8 E A, B 9 F C 10 G D, F 12 H E, G 15 Answer the following: What is the critical path? How long will it take to complete this project? Can activity E be delayed without delaying the completion of the project? If so, how many days?
Schedule the following activities using CPM: Table 2 ACTIVITY IMMEDIATE PREDECESSOR TIME (WEEKS) A — 8 B A 4 C A 4 D C 8 E B, D 2 F D 6 G E, F 2 Question 25 (1 point) What is the critical path? (Show your diagram and calculations) Question 25 options: A-C-D-E-G A-B-E-G A-B-D-E-G A-C-D-F-G A-B-D-F-G How many weeks will it take to complete the project? What is B slack time?
The following activities are part of a project to be scheduled using CPM: ACTIVITY IMMEDIATE PREDECESSOR TIME (WEEKS) A — 3 B A 9 C A 5 D C 2 E B D 7 F D 6 G E F 4 b. What is the critical path? A-B-D-F-G A-B-E-G A-C-D-F-G A-C-D-E-G c. How many weeks will it take to complete the project? Number of weeks d. How much slack does activity B have? Slack of activity B week(s)
The following represent activities in Marc Massoud's Construction Company project: Activity Immediate Predecessor(s) Time (weeks) Activity Immediate Predecessor(s) Time (weeks) = C, E WLUI WNVN = n a a) Choose the correct network to represent this situation. OA. OB b) The critical path is B-E-F-H c) The length of the critical path is . weeks.
A project has the following set of activities Activity Immediate Predecessor Duration (weeks) A - 8 B - 10 C A 3 D A 7 E B, C 6 F B, C 7 G D, E 5 H F 3 Draw the AON diagram Identify all the possible paths What is the critical path? Can activity B be delayed without delaying the completion of the project? If so, by how many days?
Using the following information about Project A, its activities and predecessor activities below: Activity Predecessors A в B C D E, F D G The following table contains the pessimistic, likely, and optimistic estimates for how long activities are estimated to take for Project A. Activity Pessimistic Likely Optimistic 2 5 20 H 16 e. Calculate the time estimates (TE) f. Calculate the variance (s) g. Convert the TE to whole integers and place them in the network diagram for...
I need help with the following problem. Schedule the following activities using CPM. ACTIVITY Immediate Predecessors Time in Weeks A ---- 2 B A 5 C A 4 D B 3 E C, D 6 F D 3 G F 3 H E, G 4 Draw the network diagram below using the square activity I have provided. Just select the object, then copy it and paste how many you need and then arrange them in the order you need and...
1. Consider the following project. Activity Duration (weeks)5 Immediate Predecessor(s) Cost (S) 1000 | 400 I 200 | 1200 | 500 | 700 | 1200 | 800 | 1800 | 1500 | 400 (a) Construct the activity-on-node (AoN) network for the relations among the activities in the (b) Using the activity-on-node (Ao) network developed in part (a), determine the critical path and the minimum time required to complete the project. Develop the earliest start and finish times, the latest finish...
1. Given the major activities and their duration for a building project as follows: Activity DurationSuccessors B,C D,E,F HI,J K,L L,M K,L 10 4 (a) Draw the precedence network. (b) Calculate the EST, EFT, LST and LFT of each activity using the forward pass and backward pass methods entire project about a delay of the activity D by 3 days? (Remark: please redraw the diagram to verify (c) Highlight/identify the critical path in the precedence network and find the duration...