Gantt & Critical Path Diagram
Gantt & Critical Path Diagram
Example
In the following tables there are seven tasks, labeled a through g. Some tasks can
be done concurrently (a and b) while others cannot be done until their predecessor
task is complete (c and d cannot begin until a is complete). Additionally, each task
has three-time estimates: the optimistic time estimate (O), the most likely or normal
time estimate (M), and the pessimistic time estimate (P). The expected time (TE)
is estimated using the beta probability distribution for the time estimates, using the
formula (O + 4M + P) ÷ 6.
a — 2 4 6 4.00
b — 3 5 9 5.33
c a 4 5 7 5.17
d a 4 6 10 6.33
e b, c 4 5 7 5.17
f d 3 4 8 4.50
g e 3 5 8 5.17
Once this step is complete, one can draw a Gantt chart or a network diagram.
A Gantt chart created using Microsoft Project (MSP). Note (1) the critical path is in
red, (2) the slack is the black lines connected to non-critical activities, (3) since
Saturday and Sunday are not work days and are thus excluded from the schedule,
some bars on the Gantt chart are longer if they cut through a weekend.
A Gantt chart created using OmniPlan. Note (1) the critical path is highlighted, (2)
the slack is not specifically indicated on task 5 (d), though it can be observed on
tasks 3 and 7 (b and f), (3) since weekends are indicated by a thin vertical line,
and take up no additional space on the work calendar, bars on the Gantt chart are
not longer or shorter when they do or don't carry over a weekend.
A network diagram can be created by hand or by using diagram software. There
are two types of network diagrams, activity on arrow (AOA) and activity on node
(AON). Activity on node diagrams are generally easier to create and interpret. To
create an AON diagram, it is recommended (but not required) to start with a node
named start. This "activity" has a duration of zero (0). Then you draw each activity
that does not have a predecessor activity (a and b in this example) and connect
them with an arrow from start to each node. Next, since both c and d list a as a
predecessor activity, their nodes are drawn with arrows coming from a. Activity e is
listed with b and c as predecessor activities, so node e is drawn with arrows
coming from both b and c, signifying that e cannot begin until both b and c have
been completed. Activity f has d as a predecessor activity, so an arrow is drawn
connecting the activities. Likewise, an arrow is drawn from e to g. Since there are
no activities that come after f or g, it is recommended (but again not required) to
connect them to a node labeled finish.