Answer Happy

The precedence relationships among 12 activities required to perform a project are given in the table below. Activity ABC DE F G H I JKL Duration 3 2 5 4 6 1 5 3 4 4 5 10 Immediate C, DE, K F F, G G H₂I| H₂I J J J J Follower(s) (a) Construct the activity-on-arc network for the relations among the activities in the project. (b) Apply the Critical Path Method (i.e., do the forward and backward calculations) to determine the minimum time required to complete the project, • the earliest start time, earliest finish time, latest start time and latest finish time, and slack time for each activity, • the early and late event times, - the critical activities, and the critical path. (c) Based on the results of part (b), draw • the Early Start Schedule, and the Late Start Schedule for the project. (d) How many days are available for the Activity D and H without delaying the project? (e) Suppose that the indirect cost per day is $250, and we wish to reduce the completion time of the project by time crashing some of the following activities, which can be crashed linearly. Apply heuristic procedure given in the lecture notes to find a feasible solution that minimizes the total crashing cost. Normal Cost Crash Cost Normal Time Crash Time Activity ($) ($) (days) (days) B 800 600 2 1 D 600 300 4 2 G 1000 550 5 2 H 500 400 3 2 K 300 200 5 3 J 1000 400 4 2