Question: Scheduling, AOA (Using Linear Programming to Find a Critical Path Tasks Precedence Time a - 2 Weeks b - 4 Weeks c - 3 Weeks
Scheduling, AOA (Using Linear Programming to Find a Critical Path
| Tasks | Precedence | Time |
| a | - | 2 Weeks |
| b | - | 4 Weeks |
| c | - | 3 Weeks |
| d | a | 3 Weeks |
| e | a | 5 Weeks |
| f | c | 6 Weeks |
| g | c | 4 Weeks |
| h | d | 4 Weeks |
| i | d | 8 Weeks |
| j | b,e,f,i | 2 Weeks |
| k | - | 4 Weeks |
| l | g,k | 3 Weeks |
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
