We will be using a basic node schedule to look at some of the basic concepts of scheduling.

Complete the questions given the basic schedules below.

Fill out the following table and answer the questions:

Node Duration Predecessor Earliest Start

$($ES$)$

Latest Start

$($LS$)$

On the

critical path?

A $3$ NONE $00$

B $5$ A

C $2$ A

D $10*$ B

E $4$ C$,$ D

F $9$ D

G $2$ E

H $1$ G

I $2$ G

J $4$ H$,$ I

K $0$ J$,$ F

$1.$ What is the minimum amount of time this project would take?

$2.$ Which nodes form the critical path?

$3.$ What is the float of nodes along the critical path?

$4.$ What is the earliest date Node G can begin?