Consider a project network with five activities, their normal durations, their shortest possible durations (which can be achieved at extra cost), & the acceleration cost per time unit.
|
Activity |
Immediate predecessor(s) |
Normal duration (in days) |
Shortest possible duration (in days) |
Unit cost of acceleration |
|
A |
– |
6 |
3 |
80 |
|
B |
C |
3 |
2 |
40 |
|
C |
A |
2 |
1 |
50 |
|
D |
C |
4 |
2 |
20 |
|
E |
B, C |
1 |
1 |
Â¥ |
(a) Draw the network, determine the critical path (use the forward & backward recursion as discussed in class & then calculate the total floats), & calculate the duration of the project. Which of the activities are critical?
(b) Accelerate the project by one day. Clearly indicate which activity/combinations of activities could be accelerated in order to speed up the project (list all possibilities), & then indicate which activity or activities should be accelerated. What are the associated costs?
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
