Question: TOPIC: Linear Programming using assignment method and network models D. Given below is a set of tasks coded as COMPANY Activity Predecessors ES EF Time

TOPIC: Linear Programming using assignment method and network models

TOPIC: Linear Programming using assignment method

D. Given below is a set of tasks coded as COMPANY Activity Predecessors ES EF Time (Weeks) LF LS Slack Remark 4 o M None P 5 1 6 2 3 7 A N Y , O.MP 1. 2. 3. Draw the network diagram (Hint: add a dummy activity X). List all possible paths and calculate their total completion time. Identify the Optimal Completion Time (OCT), Critical Path (CP), Critical Activities (CA) and Non-Critical Activities (NCA). Construct the ES, EF, LF, LS and slack time for each activity. How many weeks can activity P be delayed without delaying the entire project at its expected completion time? 4. 5

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!