Free Sample
FTSA Engineering Company won a new project to install the smart efficient solar panels
Solution.pdfQUESTION 1:
FTSA Engineering Company won a new project to install the smart efficient solar panels on a newly built building. They have to perform several activities. Following table and network provides information about the project:
Normal |
Crash |
Crash |
||||
Activity |
Cost($) |
Time (days) |
Cost($) |
|||
A |
7800 |
4 |
10740 |
|||
B |
9400 |
4 |
12120 |
|||
C |
16850 |
4 |
18615 |
|||
D |
12820 |
7 |
14380 |
|||
E |
9850 |
5 |
11255 |
|||
F |
24800 |
3 |
36050 |
|||
G |
4580 |
3 |
5350 |
|||
H |
6450 |
3 |
7810 |
|||
I |
4875 |
1 |
6685 |
|||
J |
26850 |
11 |
28700 |
|||
K |
20695 |
4 |
20695 |
|||
L |
19580 |
7 |
25265 |
|||
M |
5860 |
3 |
7080 |
|||
N |
11310 |
1 |
11310 |
|||
O |
8250 |
5 |
9540 |
|||
P |
16740 |
5 |
22650 |
|||
Q |
17665 |
1 |
17665 |
|||
R |
2750 |
1 |
3730 |
|||
S |
9890 |
1 |
15910 |
|||
T |
21580 |
2 |
24080 |
|||
U |
18460 |
10 |
19985 |
|||
V |
34680 |
11 |
37530 |
|||
W |
6500 |
6 |
8330 |
FOLLOWING NETWORK IS DRAWN BY USING NORMAL TIME (DAYS):
-
Identify all the paths in the network and state their length? (Add as many rows you needed)
No. |
Paths |
Length of the Path |
1. |
||
2. |
||
-
What is the normal project completion cost?
-
What is the project completion time?
-
State critical path/s in the network?
-
Assume that the project manger wants to shorten the project by six DAYS. What crashing decisions do you recommend to meet the desired completion time? When tie, must prefer least cost.
To answer part #(e) MUST fill out the given table and MUST support your work separately.
Trial |
Critical Path/s (Before Crashing) |
Project Completion Time (Before Crashing) |
Activity/ Activities crashed |
Crash Cost |
Project Completion Time (After Crashing) |
1 |
|||||
2 |
|||||
3 |
|||||
4 |
|||||
5 |
|||||
6 |
-
After completing part (e), fill table below:
Trial #2 |
Trial #5 |
|
Number of critical path/s before starting |
-
What is the total crashing cost when project is reduced by six DAYS?
-
After reducing project by six DAYS, identify all the paths in the network and state their length? (Add as many rows you needed)
No. |
Paths |
Length of the Path |
1. |
||
2. |
||
-
Can you further reduce the project duration? Yes/No. If ‘No’ Justify why?
-
You are performing 1st crashing What are options/alternative of activities available that can reduce the project duration by one day, state all the options/alternative of activities with respective costs. (Add as much rows you needed)
No. |
Options / Alternatives |
Cost of option |
1. |
||
QUESTION 2:
A plant is planning to install a new shift to its existing production capacity. There are a number of activities from legal requirements to human resource issues to be completed before the shift becomes productive. The management has determined the activities required completing the project; network is drawn by using precedence relationship as follows: (duration is in week/s)
Activity |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
Activity Cost per week ($000) |
21 |
18 |
24 |
18 |
32 |
15 |
18 |
40 |
28 |
15 |
18 |
32 |
36 |
30 |
44 |
a)What is project completion time?
b)Develop a baseline budget form for this project assuming that all tasks start at their latestartingtimes and costs given for each activity is equally distributed over the duration of activities. (e.g. if activity cost is 48 and duration is 8 then cost for each period will be 6)
(Must use given template and it must be typed. Don’t alter the table. Don’t change the Font size))
(000)
Task |
Budget |
0 |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
14 |
15 |
16 |
17 |
18 |
19 |
20 |
21 |
22 |
A |
|
|
|
|||||||||||||||||||||
B |
|
|
|
|||||||||||||||||||||
C |
|
|
|
|||||||||||||||||||||
D |
|
|
|
|||||||||||||||||||||
E |
|
|
|
|||||||||||||||||||||
F |
|
|
|
|||||||||||||||||||||
G |
|
|
|
|||||||||||||||||||||
H |
|
|
|
|||||||||||||||||||||
I |
|
|
|
|||||||||||||||||||||
J |
||||||||||||||||||||||||
K |
||||||||||||||||||||||||
L |
||||||||||||||||||||||||
M |
||||||||||||||||||||||||
N |
||||||||||||||||||||||||
O |
||||||||||||||||||||||||
TOTAL |
||||||||||||||||||||||||
CUMULATIVE |
|
c) What is BAC of the above project?
d) In which week/s you need the most cash?
e) In the given network, calculate free slack and complete the table given as asked. (Add as many rows you needed)
No. |
Activities |
Free Slack > 0 |
1. |
QUESTION 3:
Note: Time units are in weeks.
-
How many minimum resources required executing the above schedule as it is without any resource constraint?
-
Refer to the network on previous page; construct the resource loading schedule when only 7 resources are available.
Use Minimum slack, smallest duration, lowest Id heuristic.
(Must use this given Template BELOW and it must be typed, Don’t change the font)
Task |
0 |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
14 |
15 |
16 |
17 |
18 |
19 |
20 |
21 |
22 |
23 |
24 |
25 |
26 |
27 |
28 |
A |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
B |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
C |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
D |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
E |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
F |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
G |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
H |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
I |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
J |
|||||||||||||||||||||||||||||
K |
|||||||||||||||||||||||||||||
L |
|||||||||||||||||||||||||||||
M |
|||||||||||||||||||||||||||||
N |
|||||||||||||||||||||||||||||
O |
|||||||||||||||||||||||||||||
Resources Scheduled |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||||||||||
Resources Available |
-
List the order in which you scheduled the activities of the project.
-
What is the project completion time after loading all the resource? ______________
-
After loading all activities, state slacks for each activity.
Activity |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
Slack |
Tired of the boring assignments to be submitted to colleges and universities? MyAssignmentMart.com gives you multiple reasons to trust it with your orders. We employ PhD experts handpicked from prestigious universities over the globe. We cater to quality assignment help, dissertation writing services and online essay help, covering more than 100 academic subjects. We pledge to complete your assignments on time and never compromise when it comes to deadline. Our prices for assignments are the most competitive in the market and make sure the cost suits your budget.

Get Assignment Help Now...!
Subjects We Offer
- Engineering Assignment Help
- MATLAB Assignment Help
- Mechanical Engineering Assignment Help
- Civil Engineering Assignment Help
- Computer Science Assignment Help
- Electrical Engineering Assignment Help
- Electronics Assignment Help
- Economics Assignment Help
- Management Assignment Help
- Do My Assignment
- Cheap Assignment Help
- Programming Assignment Help
- Law Assignment Help
- Assignment Provider
- Finance Assignment Help
- Python Assignment help
- Healthcare Management Assignment Help
- Computer Network Assignment Help
- History Assignment Help
- Industrial Engineering Homework Help
- IT Management Assignment Help
- Nursing Assignment Help
- Operating System Assignment Help
- Statistics Assignment Help
- Material Science Assignment Help
- Mechanical Engineering Homework Help
- University Assignment Help
- Agriculture Engineering Homework Help
- ATHE Courses Assignment Help
- Capital Budgeting Assignment Help
- BTEC Assignment Help
- HND Assignment Help
- Material Science Assignment Help
- Psychology Assignment Help
- Resit Assignment Help
- Computer Architecture Assignment Help
- Data Structure Assignment Help
- Database Assignment Help
- PHP Assignment Help