|
Activity |
Predecessor |
Duration (weeks) |
|
A |
None |
2 |
|
B |
A |
4 |
|
C |
A |
3 |
|
D |
A |
2 |
|
E |
B |
3 |
|
F |
C |
6 |
|
G |
C, D |
5 |
|
H |
E, F |
6 |
|
I |
G |
5 |
|
J |
H, I |
5 |
Activities B and H can be shortened by a minimum of 2 time units. Which activity would you shorten to reduce the project duration of 2 weeks. Why? (be specific)
|
ACTIVITY |
DURATION |
ES |
EF |
LS |
LF |
SLACK |
|
A |
2 |
0 |
2 |
0 |
2 |
0 |
|
B |
4 |
2 |
6 |
4 |
8 |
2 |
|
C |
3 |
2 |
5 |
2 |
5 |
0 |
|
D |
2 |
2 |
4 |
5 |
7 |
3 |
|
E |
3 |
6 |
9 |
8 |
11 |
2 |
|
F |
6 |
5 |
11 |
5 |
11 |
0 |
|
G |
5 |
5 |
10 |
7 |
12 |
2 |
|
H |
6 |
11 |
17 |
11 |
17 |
0 |
|
I |
5 |
10 |
15 |
12 |
17 |
2 |
|
J |
5 |
17 |
22 |
17 |
22 |
0 |
FORWARD PASS
1. Go from left to right in a network.
2. ES = maximum of the EF value from all the direct predecessors.
3. EF = ES + Duration.
BACKWARD PASS
1. Go from right to left in a network.
2. LF = minimum of the LS value from all the direct predecessors.
3. LS = LF - Duration.
CRITICAL PATH
1. Total slack of all activities should be 0.
2. The total duration of all the activities should be the highest.
3. Slack = LF - EF or LS - ES
CRITICAL PATH & DURATION
A + C + F + H + J = 22
SINCE B IS NOT A CRITICAL ACTIVITY, WE WILL SHORTEN ACTIVITY H BY 2 PERIODS TO GET THE NECESSARY CRASHING, BECAUSE B HAS A SLACK OF 2 AND WOULD INCUR ADDITIONAL COST WITHOUT EVEN AFFECTING THE CRITICAL PATH. a CRITICAL ACTIVITY, ON THE OTHER HAND, WOULD ENABLE US TO SHORTEN THE ENTIRE PROJECT BY 2 PERIODS.
1. Consider the following information: Activity Predecessor Duration (weeks) A None 2 B A 4 C...
Activity Predecessor Duration (weeks) a none 12 b none 5 c a, b 7 d c, e 2 e b 8 f e 9 g d 5 h f,g 8 Your firm is implementing a balanced scorecard. As the project manager, you need to make sure the project is completed on time and on-budget. The table below lists the steps that need to be complete. The data analysis team members are going to be late delivering some key data points...
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?
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?
Lecture Exercise #13 Project Crashing Activity Predecessor(s) Time (weeks) Normal Crash 3 2 A None None None B Cost Normal Crash 1000 1600 2000 2700 300 300 1300 1600 2 1 С 1 1 D A 7 3 E 6 3 B с 1000 5000 F 2 850 4000 1500 NA G D. E 4 2000 What's the normal project completion time? Identify the critical path If you'd like to shorten the project by one week, which activity should you...
Schedule the following activities using CPM: ACTIVITY IMMEDIATE PREDECESSOR TIME (WEEKS) A — 1 B A 4 C A 3 D B 2 E C, D 5 F D 2 G F 2 H E, G 3 b. What is the critical path? A-B-D-F-G-H A-C-D-F-G A-C-E-H A-B-D-E-H c. How many weeks will it take to complete the project? Number of weeks d. Which activities have slack, and how much? D, 2 weeks; G, 1 week; and H, 1 week....
Consider the following set of activities: Time Predecessor Activity Required Activities A 5 None B 4 A C 5 B D 8 B E 9 C F 6 C,D G 8 D H 3 E,F,G a. Draw the CPM network for this problem. b. Calculate and summarize the earliest and latest start and finish times, the slack for each activity, and the critical activities. c. What is the earliest time that the project can be completed? d. If the project needed to be completed...
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...
Problem 5-13 A construction project is broken down into the following 10 activities: ACTIVITY IMMEDIATE PREDECESSOR TIME (WEEKS) 1 — 5 2 1 3 3 1 4 4 1 2 5 2,3 6 6 3 4 7 4 2 8 5 4 9 6,7 7 10 8,9 5 b-1. What is the critical path? 1-3-5-8-10 1-3-6-9-10 1-4-7-9-10 1-2-5-8-10 b-2. How many weeks will the project take to complete? Number of weeks c. If activities 1 and 10 cannot be shortened,...
5.) Consider a project whose activities are listed in the table below. Activity A will have slack time as long as… Activity Immediate Predecessors A None B None C A D B E C, D F E G E a. Duration of A < Duration of B b. Duration of A + Duration of C > Duration of B + Duration of D c. Duration of A + Duration of C < Duration of B + Duration of D...
: A network consists of the following list. Times are given in weeks. Activity Preceding Duration A -- 9 B A 2 C A 12 D A 5 E B 6 F B 8 G C, F 3 H D 2 I H 8 J G, I 6 K E, J 2 Draw the network diagram. Find ES, EF, LS, LF, and the slack times for each of the activities. Which activities are critical? Determine the critical path(s). What is...