Homework #3 - Project Cost Management Schedule Trim problem You have a request f
ID: 360750 • Letter: H
Question
Homework #3 - Project Cost Management Schedule Trim problem You have a request for a change in a project schedule to complete the project three days early. So, you must reduce the time and finish three days earlier than originally scheduled. You want to reduce the time at minimal additional costs. The attached spreadsheet provides data about the project. Use it to determine your answer. Tasks are to be trimmed by whole days. Task Successor Tasks Duration (days) Minimum Duration Cost to Trim the Task per Day ($000) Number of Days Trimmed from the Task Cost of Trimming A B,E 4 3 1 B G 2 2 0.5 C D 5 4 0.5 D J 5 3 1 E F 4 3 1 F H 3 3 0.75 G R 5 4 2 H M 4 4 1 J K 4 4 1 K L 4 3 0.75 L N 4 3 1 M P 3 3 2 N NONE 4 3 2 P S 3 2 1 R N 5 4 0.75 S N 3 2 2 Totals: $0 Trim 3 days from the project duration. What is the additional cost? Note, you cannot trim below the minimum duration! 1. Create the network diagram. (You should use MS Project.) 2. Trim the project three days with minimal additional cost. Answer these questions and/or show the below listed items. (Enter the answers in the spreadsheet, complete the MS Project entries, and submit via via the Submit Assignment link on the right to be graded.) 1. What tasks have you trimmed and how many days were trimmed from each task? Enter the answers in the spreadsheet. 2. List the resulting critical path(s) resulting from your solution showing the tasks trimmed. What is the cost to reduce the project by three days?
Explanation / Answer
Answer--I am trying to get MS Project , mean while let me answer your question without the help of MS Project
The network has following three paths
A---B---G---R---N having length (4+2+5+5+4) = 20days
A---E---F---H---M---P---S---N having length (4+4+3+4+3+3+3+4) =28days
C---D---J---K---L---N having length (5+5+4+4+4+4) =26days
From the above paths it is easy to construct the Network diagram with starting A and C and finishing with N. After A starting B and E giving two paths as mentioned above and third path from C onwards. R,S and L merging for start of last activity N.
At normal times with normal cost the critical path is A-E-F-H-M-P-S-N of durationof completion as 28 days which can be reduced to 27 days by crashing (Trimming) N or S or P or E or F because other activities F,H and M are having their minimum times equal to normal durations.
The minimum cost is corresponding to A,E & P, it is prudent to trim A by 1 day and reduce the duration of the 1st path also.
Next we trim E by one day and then we get the duration of the project as 26 days.
Now the 3rd path is also critical and hence further crashing is required for both the critical paths to reduce the project duration. Options are; N alone or combinations of P & S from 2nd path and C,D,K & L from 3rd path. Best combination (minimum cost of 1.5) is trimming C and P both by one day . At this stage the durations of the paths are as follows:
A---B---G---R---N having length (3+2+5+5+4) = 19days
A---E---F---H---M---P---S---N having length (3+3+3+4+3+2+3+4) =25days
C---D---J---K---L---N having length (4+5+4+4+4+4) =25days
Further crashing is possible with options of either N or S with either D or K or L. Best option is N
The Excel sheet, showing crashing upto three days with total cost of 3,500 for trimming, is as follows:
Task Successor Tasks Duration (days) Minimum Duration Cost to Trim the Task per Day ($000) Number of Days Trimmed from the Task Cost of Trimming
A B,E 4 3 1 1 1000
B G 2 2 0.5 0
C D 5 4 0.5 1 500
D J 5 3 1 0
E F 4 3 1 1 1000
F H 3 3 0.75 0
G R 5 4 2 0
H M 4 4 1 0
J K 4 4 1 0
K L 4 3 0.75 0
L N 4 3 1 0
M P 3 3 2 0
N NONE 4 3 2 0
P S 3 2 1 1 1000
R N 5 4 0.75 0
S N 3 2 2 0
Totals:
3500
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.