Put your name in cell B$8$

There are two backhoes available, nicknamed Ruby and Wanda

$1$ Create a network diagram and calculate ES$,$ LF$,$ SL for each activity $(8$ points$)$

$2$ Create a Gantt chart showing non$-$constrained time$-$phased resources scheduled in each time period. Calculate ES$,$ LF$,$ SL for each activity $(7$ points$)$

$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. $(20$ points$)$

$4$ Recreate the network diagram from the constrained resource schedule $(10$ points$)$

$5$ Create a responsibility matrix $($pg $122)$ for this project $(5$ points$)$

Venkata Nikitha Gedala

ES ID EF

SL Resource Network Diagram

LS DUR LF

A

ID Res Predessor Dur ES LF SL

A $1$ None $1$

B $1$ None $2$

C $1$ None $3$

D $1$ A$,$ B $2$

E $2$ B$,$ C $4$

F $2$ D$,$E $2$

Gantt

ID Res Predessor Dur ES LF SL $01234567891011$

A $1$ None $1$ Non$-$constrained

B $1$ None $2$ Before

C $1$ None $3$

D $1$ A$,$ B $2$

E $2$ B$,$ C $4$

F $2$ D$,$E $2$

Resource scheduled $000000000000$

Resource available $222222222222$

Gantt

ID Res Predessor Dur ES LF SL $01234567891011$

A $1$ None $1$ Constrained

B $1$ None $2$ After

C $1$ None $3$

D $1$ A$,$ B $2$ Priorities

E $2$ B$,$ C $41$: Minimum slack

F $2$ D$,$E $22$: Smallest duration

Resource scheduled $0000000000003$: Lowest ID letter

Resource available $222222222222$

ES ID EF

SL Resource Resource constrained network diagram

LS DUR LF

A

ID Res Predessor Dur ES LF SL

A $1$ None $1$

B $1$ None $2$

C $1$ None $3$

D $1$ A$,$ B $2$

E $2$ B$,$ C $4$

F $2$ D$,$E $2$

Responsibility Matrix

Backhoes Available

Task Ruby Wanda

A

B

C

D

E

F