Question: For the project described by the above table, answer the following questions. For (a) and (b) please add a drawing and calculation in this document
For the project described by the above table, answer the following questions. For (a) and (b) please add a drawing and calculation in this document (photo may be added if hand drawn).
(a) Draw the network diagram.
(b) Using Earliest Start / Earliest Finish, and Latest Start / Latest Finish, find the critical path. Clearly indicate the sequence of activities on the critical path and compute the length of the critical path.
The table below indicates the feasibility of crashing each of the activities in this project and the related per-week costs to reduce an activity.
| Activity | Time Required (weeks) | Minimum Feasible Time (weeks) | Cost per Week |
|---|---|---|---|
| A | 3 | 2 | $750 |
| B | 4 | 3 | $1700 |
| C | 3 | 3 | - |
| D | 5 | 3 | $1900 |
| E | 4 | 3 | $1850 |
| F | 3 | 3 | - |
(c) If this project must be completed in 12 weeks, clearly explain the least expensive way to accomplish this.
(d) Returning to the original project of parts (a) and (b), it has been determined that the task completion times for task C have the following distribution. What are the corresponding critical paths and project completion times for each possible activity C duration time?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
Study Help