Gantt diagrams Example 1

The table below shows the tasks involved in a project, with their durations and immediate predecessors.
Task A B C D E F G Duration 3 4 6 5 1 6 7 Immediate predecessors A B B C, D, E

Gantt diagrams Example 1

The precedence network for this project, shown below, was found in Section 1. 3 A(3) 1 0 0 B(4) 3 4 7 3 2 D(5) 8 C(6) E(1) 5 F(6) 15 15 4 G(7) 8

Gantt diagrams - Example 1

A D G

10

12

14

16

Hours

The critical activities, A, D and G are placed at the top of the chart.

Gantt diagrams - Example 1

A B D G

10

12

14

16

Hours

The earliest that activity B can start is at time 0, and the latest that it can finish is at time 7.

Gantt diagrams - Example 1

A B C D G

10

12

14

16

Hours

The earliest that activity C can start is at time 0, and the latest that it can finish is at time 8.

Gantt diagrams - Example 1

A B C E D G

10

12

14

16

Hours

The earliest that activity E can start is at time 4, and the latest that it can finish is at time 8.

Gantt diagrams - Example 1

A B C E F 2 4 6 8 10 12 14 16 Hours D G

The earliest that activity F can start is at time 4, and the latest that it can finish is at time 15.

Gantt diagrams Example 1

Problem 1
A and B both require the use of the same piece of equipment. Can the project still be completed in 15 hours?

Gantt diagrams - Example 1

A B C E F 2 4 6 8 10 12 14 16 Hours D G

At present, A and B are both scheduled at the same time. Since A is a critical activity, moving A would result in the project being delayed.

Moving B means that E and F must also move.

Gantt diagrams - Example 1

A D B C E F 2 4 6 8 10 12 14 16 Hours G

The project can still be completed in 15 hours.

Gantt diagrams Example 1

Problem 2
A and C must both be done by a qualified person. There is only one qualified person available. Can the project still be completed in 15 hours?

Gantt diagrams - Example 1

A D B C E F 2 4 6 8 10 12 14 16 Hours G

At present, A and C are scheduled at the same time. Again, as A is a critical activity, it is better to move C.
Neither E nor F depend on C, but G does depend on C. C can be moved by two hours

Gantt diagrams - Example 1

A D B C E F 2 4 6 8 10 12 14 16 Hours G

At present, A and C are scheduled at the same time. Again, as A is a critical activity, it is better to move C.
Neither E nor F depend on C, but G does depend on C. C can be moved by two hours but if it moves a further hour to avoid overlap with A, then G must also move.

Gantt diagrams - Example 1

A D B C E F 2 4 6 8 10 12 14 16 Hours G

The project can be completed in 16 hours.

Gantt diagrams and scheduling

The table below shows the tasks involved in a project, with their durations, immediate predecessors and number of workers required.
Task
A B

Duration
2 3

Immediate predecessors
-

Number of workers
2 1

C
D E F

5
6 8 2

A, B C C

2
2 2 2

D, E

How many workers are needed if all activities are scheduled to start as early as possible?

Gantt diagrams and scheduling

The precedence network shown below was found in Section 1.

2
2 A(2)

13

13

1
0 0

B(3) 3 C(5)

3
7

D(6)

G(4)

6
17 17

E(8) F(2)

4
5 5

Gantt diagrams and scheduling

C (2)

E (2)

G (2)

10

12

14

16

Days

Put the critical activities along the top. (The numbers in brackets show the number of workers required)

Gantt diagrams and scheduling

C (2) A (2)

E (2)

G (2)

10

12

14

16

Days

The earliest start time for activity A is at time 0, and the latest finish time is at time 7.

Gantt diagrams and scheduling

C (2) A (2) B (1)

E (2)

G (2)

10

12

14

16

Days

The earliest start time for activity B is at time 0, and the latest finish time is at time 7.

Gantt diagrams and scheduling

C (2) A (2) B (1) D (2)

E (2)

G (2)

10

12

14

16

Days

The earliest start time for activity D is at time 3, and the latest finish time is at time 13.

Gantt diagrams and scheduling

C (2) A (2) B (1) D (2) F (2)

E (2)

G (2)

10

12

14

16

Days

The earliest start time for activity F is at time 5, and the latest finish time is at time 17. If this schedule is used, 6 workers are needed. (6 are needed on days 6 and 7).

Gantt diagrams and scheduling

Problem
Only four workers are available.

Is it possible to complete the project in the same amount of time?

Gantt diagrams and scheduling

C (2) A (2) B (1) D (2) F (2)

E (2)

G (2)

10

12

14

16

Days

We need to move some tasks so that only four workers are needed at any given time. At present 5 workers are needed for the first two days. Task B can be moved so that it starts after A has finished. This means that D must also move.

Gantt diagrams and scheduling

C (2) A (2) B (1)

E (2)

G (2)

D (2) F (2)

10

12

14

16

Days

We need to move some tasks so that only four workers are needed at any given time. At present 6 workers are needed for days 6 and 7. Task F can be moved so that it starts after D has finished.

Gantt diagrams and scheduling

C (2) A (2) B (1)

E (2)

G (2)

D (2) F (2)

10

12

14

16

Days

Now only four workers are needed at any given time. Workers 1 and 2 could do activities C, E and G. Worker 3 could do A, B, D and F Worker 4 could do A, D and F (with 3 days off between A and D).