Question: Problem 1. (Critical Path Method.) The following table describes each activity's predecessors in a project: Activity Predecessor Duration (weeks) A A B D E F

Problem 1. (Critical Path Method.) The following
Problem 1. (Critical Path Method.) The following table describes each activity's predecessors in a project: Activity Predecessor Duration (weeks) A A B D E F BD E B, D, G G H 8 8 7 4 4 3 6 10 3 6 J K M N J GK HM 1. Draw a corresponding AON (Activity-on-Node) project network and label the activities and their duration on the diagram. (Continue with Problem 1) 2. Compute ES, EF, LS and LF for each activity. 3. Find the critical path(s). 4. Determine the total slack and free slack of each activity. (You may use the following table to record your answer to questions 2, 3, and 4.) Activity ES EFLS LF Total slack Free slack B D E F z 37 - M N Critical path(s) is

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!