Rules for Determining Event Times

Forward Pass - Greatest number

In the forward pass through a network, the earliest time an event can occur is determined by the greatest number obtained from considering all the activities ending at that event.

Undisplayed Graphic

Reverse Pass - Smallest number

In the reverse pass through a network, the latest time an event can occur (without changing the critical path) is determined by the smallest number obtained from considering all the activities starting at that event.

Undisplayed Graphic

Rules for Determining the Critical Path

An activity is on the critical path if its total float is zero. Also:

Undisplayed Graphic

Activity A, with duration D is said to be on the critical path if:

Undisplayed Graphic

Undisplayed Graphic

Example Problem

Undisplayed Graphic

Note: At the beginning event and the final event, the following must be true:

Undisplayed Graphic

Undisplayed Graphic

Example

You are going to build a prefabricated steel warehouse according to the plans in Fig. 1 and using the activities in Table 1 below. The walls are primed, and the roof, doors, and windows are prepainted. You have the following constraints on the erection:

Front/Back Sides

Plan View(1 & 3) (2 & 4)

Undisplayed Graphic Undisplayed Graphic Undisplayed Graphic

Figure 1 Warehouse Plans

Technical Constraints

1.Items must be assembled in the following order: footing, walls, roof, lights.

2.Doors and windows can be installed after the corresponding sides are erected.

3.Both windows must be installed at the same time.

4.Walls can be painted only after all walls are erected.

Table 1. List of Activities Required to Build a Prefabricated Steel Warehouse

Activities

Activities

Activities

Aclear and grub

Finstall wall 2

Kinstall windows 2&4

Bexcavate footing

Ginstall wall 3

Linstall roof

Crebar footing

Hinstall wall 4

Minstall lights

Dplace footing

IInstall door 1

Npaint walls

Einstall wall 1

JInstall door 3


First, we will make a list of preceding activities (PA) (see Table 2) indicating which activities must precede each given activity.

Table 2. Preceding Activities (PA)

Activity

Preceding Activities

A

B

A

C

A.B

D

A.B.C

E

A.B.C.D

F

A.B.C.D

G

A.B.C.D

H

A.B.C.D

I

A.B.C.D.E

J

A.B.C.D.G

K

A.B.C.D.F.H

L

A.B.C.D.E.F.G.H

M

A.B.C.D.E.F.G.H.L

N

A.B.C.D.E.F.G.H

Next, we will reduce the PA list to an immediate preceding activity (IPA) list (see Table 3).

Later, this IPA information will help us in drawing the network diagram.

Table 3. Immediately Preceding Activities (IPA)

Activity

IPA

Preceding Activities

A

B

A

C

B

A comes before B

D

C

A.B comes before C

E

D

A.B.C. comes before D

F

D

A.B.C. comes before D

G

D

A.B.C. comes before D

H

D

A.B.C. comes before D

I

E

A.B.C.D. comes before E

J

G

A.B.C.D. comes before G

K

F.H

A.B.C.D. comes before F.H.

L

E.F.G.H.

A.B.C.D. comes before E.F.G.H.

M

L

A.B.C.D.E.F.G.H. comes before L

N

E.F.G.H.

A.B.C.D. comes before E.F.G.H.

Undisplayed Graphic

Previous Page Page Top TOC Next Page

This document was produced using an evaluation version of HTML Transit 2