Question: QUESTION 3: | 4D 8 | 2 | 48 8H12 1 2 1 9 4 13 LEGEND ESIDEF SL RES SL LS DUR LE OC

QUESTION 3: | 4D 8 | 2 | 48 8H12 1 2 1 9 4 13QUESTION 3: | 4D 8 | 2 | 48 8H12 1 2 1 9 4 13

QUESTION 3: | 4D 8 | 2 | 48 8H12 1 2 1 9 4 13 LEGEND ESIDEF SL RES SL LS DUR LE OC 4 050 44 819 060 | 19 12 1 13 0 1 2 14 1 15 0A 2 2 B 5 9 K 11 2 4 - - Z - MI 3 9 9 2 11 N 15 020 11 4 15 11 0 E 3 0 30 0 3 3 3F6 040 336 68 20 6 28 8 M 11 010 8 3 11 3G6 8 28 11 3 14 - 6L 7 8 38 14 1 15 Note: Time units are in weeks. (a) How many minimum resources required executing the above schedule as it is without any resource constraint? (b) 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 LA 28 D K Resources Scheduled Resources Available (c) List the order in which you scheduled the activities of the project. (d) What is the project completion time after loading all the resource? (e) After loading all activities, state slacks for each activity. Activity A B C D E Slack F G H I J K L M N 0 Page 10 of 10

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!