Question: Create a network diagram and calculate ES, LF, SL for each activity Create a Gantt chart showing non-constrained time-phased resources scheduled in each time period.

Create a network diagram and calculate ES, LF, SL

  1. Create a network diagram and calculate ES, LF, SL for each activity
  2. Create a Gantt chart showing non-constrained time-phased resources scheduled in each time period. Calculate ES, LF, SL for each activity
  3. Copy the Gantt chart from #2 and develop a resource-constrained schedule in the Gantt chart. No splitting. Recalculate ES, LF, SL for each activity.
  4. Recreate the network diagram from the constrained resource schedule
  5. Create a responsibility matrix (pg 122) for this project
ES ID EF SL Resource LS DUR LF Network Diagram SL ID Res Predessor Dur ES LA A 1 None 1 B 1 None 2 1 None 3 D 1 A, B 2 E 2 B, C 4 F 2 DE 2 SLO Gantt 1 2 3 4 5 6 7 00 9 10 11 Non-constrained Before ID Res Predessor Dur ES LF 1 None 1 B 1 None 2 1 None 3 D 1 A,B 2 E 2 B, C 4 F 2 DE 2 Resource scheduled Resource available 0 0 ON 0 2 0 2 0 2 0 2 0 0 2 2 0 2 2 2 0 0 2 2 Gantt 0 1 SL 2 3 4 5 6 7 8 9 10 11 Constrained After ID Res Predessor Dur ES LF A 1 None 1 B 1 None 2 1 None 3 D 1 A,B 2 E 2 B, C 4 F 2 DE 2 Resource scheduled Resource available Priorities 1: Minimum slack 2: Smallest duration O 3: Lowest ID letter 2 ONO 0 0 2 2 0 2 0 0 2 2 0 2 0 2 0 2 0 0 2 2 ES EF SL Resource LS DUR LF Resource constrained network diagram SL ID Res Predessor Dur ES LF A 1 None 1 B 1 None 2 C 1 None 3 D 1 A,B 2 E 2 B, C 4 F 2 DE 2 Responsibility Matrix Backhoes Available Task Ruby Wanda B D E F ES ID EF SL Resource LS DUR LF Network Diagram SL ID Res Predessor Dur ES LA A 1 None 1 B 1 None 2 1 None 3 D 1 A, B 2 E 2 B, C 4 F 2 DE 2 SLO Gantt 1 2 3 4 5 6 7 00 9 10 11 Non-constrained Before ID Res Predessor Dur ES LF 1 None 1 B 1 None 2 1 None 3 D 1 A,B 2 E 2 B, C 4 F 2 DE 2 Resource scheduled Resource available 0 0 ON 0 2 0 2 0 2 0 2 0 0 2 2 0 2 2 2 0 0 2 2 Gantt 0 1 SL 2 3 4 5 6 7 8 9 10 11 Constrained After ID Res Predessor Dur ES LF A 1 None 1 B 1 None 2 1 None 3 D 1 A,B 2 E 2 B, C 4 F 2 DE 2 Resource scheduled Resource available Priorities 1: Minimum slack 2: Smallest duration O 3: Lowest ID letter 2 ONO 0 0 2 2 0 2 0 0 2 2 0 2 0 2 0 2 0 0 2 2 ES EF SL Resource LS DUR LF Resource constrained network diagram SL ID Res Predessor Dur ES LF A 1 None 1 B 1 None 2 C 1 None 3 D 1 A,B 2 E 2 B, C 4 F 2 DE 2 Responsibility Matrix Backhoes Available Task Ruby Wanda B D E F

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!