Question: Data for a small project are tabulated as: Activity Preceding Activities Duration (in Days) Reusable Resource Required A None 4 2 B None 3 1
Data for a small project are tabulated as:
| Activity | Preceding Activities | Duration (in Days) | Reusable Resource Required |
|
|
|
|
|
| A | None | 4 | 2 |
|
|
|
|
|
| B | None | 3 | 1 |
|
|
|
|
|
| C | B | 2 | 0 |
|
|
|
|
|
| D | A | 6 | 4 |
|
|
|
|
|
| E | A | 10 | 2 |
|
|
|
|
|
| F | D, C | 8 | 1 |
|
|
|
|
|
| G | B | 16 | 3 |
|
|
|
|
|
| H | E | 2 | 1 |
|
|
|
|
|
| Maximum Reusable Resource Available: | 4 |
|
|
|
|
| ||
- Determine the critical path of the network without consideration for resource constraint(s).
- Determine the ranks of activities based on Resource Over Time (ROT) algorithm.
- Utilizing the ROT ranking, re-schedule the project to determine:
- The minimum length of the project allowing the maximum available resources.
- Number of iterations needed to reach the answer in part-i.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
