Department of Information Technology

MITM301

Project Management and

Business Info System
Monday, March 26, 2018 1
 Topics

Limited Resource
Allocation
25th Match 2018

Presented By Group-2(181801-181820)

Monday, March 26, 2018 2

Example
The work of a small engineering project is planned according to the AON shown below. The
labour requirement of each activity is shown below each activity box. What will be the
minimum contract duration if no more than 6 labours can be made available for the work and if
it is assumed that having started an activity it must be completed without a break?

B E H Y
2 3 8 1
2 1 2 3

A C F Z X
3 4 5 2 5
4 3 3 2 1

D G Activity Description

5 7 D
5 4 Required Labour
Limited Resource Allocation (Algorithm)
START

calculate initial early start (ES) and late start (LS) time for each activity in the project, and set time now equal
to 0, i.e., T = 0.

Determine the initial eligible activity set (EAS), i.e., those activities with all predecessor activities scheduled.

From among the members of the current EAS, determine the ordered scheduling set (OSS) of activities, i.e.,
activities with all predecessor activities completed, ordered according to LS with smallest values first and
within this characteristic, according to least activity duration first.

Consider the activities in OSS in the order listed and schedule those activities for which sufficient resources
are available for the duration of the activity. As activities are scheduled update the level of resources
available, and update the members of EAS.

Have all activities been scheduled, i.e., is EAS an

empty set? Yes STOP

No

Set Tnew= Told + 1 and updated EAS.

4
 Calculation
• Calculate initial early start (ES) and late start (LS) time and also total float (TF) for
each activity in the project
Eligible EAS A
activity set OSS A
(EAS) is A
Activity Predecessor
those 4 4 4
activities A -
with all
predecesso
r activities
scheduled.

ordered
scheduling
set (OSS)
activities
are those
activities
with all
predecesso
r activities
completed.

EAS A
ES 1
LS 1
D 3
TF 0
R 4
Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
OSS A UR 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6
2 2 2

AR 4 4 4
Activity Predecessor
Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
B A A B D D D
C A EAS C
D
EAS B C D
A C
OSS B
ES 4 4 4
D
LS 6 4 6 A
D 2 4 5 4 4 4
C
TF 2 0 2 3 3 3 3
B
R 2 3 5 2 2

OSS B C D

Why C and
B start
before D?

Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
UR 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6
2 2 2 3 3 3 3
1 1
AR 4 4 4 5 5 3 3
Activity Predecessor A B D D D D H H
D A
EAS C E
D
E B,C
A C D
H E
OSS B E
D
EAS D E H A
ES 4 8 11 4 4 4
LS 6 8 11 C
3 3 3 3
D 5 3 8
B
TF 2 0 0 2 2
D
R 5 1 2 5 5 5 5 5
E
OSS D E 1 1 1

Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
UR 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6
2 2 2 3 3 3 3 1 1 1 1 1
1 1 0 0 0
AR 4 4 4 5 5 3 3 6 6 6 5 5
 Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
EAS B C D
A B D D D
ES 4 4 4 C
EAS
LS 6 4 6 D
D 2 4 5
A C
OSS B
TF 2 0 2 D
A
R 2 3 5 4 4 4
C
OSS B C D 3 3 3 3 Activity Predecessor
B A -
Why C and 2 2 B A
B start C A
before D? D A
OSS activities E B,C
ordered F D
according to LS
G D
with smallest
values first and H E
within this Y H
characteristic,
Z F,G
according to
least activity X Y,Z
duration first.

Activity D Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
Starts when UR 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6
Resources 2 2 2 3 3 3 3
available 1 1
AR 4 4 4 5 5 3 3
Activity Predecessor A B D D D D H H H F F F F F F F
EAS C E F
F D
D G
G D A C D G F
H E OSS B E H
D F
EAS H F G A
ES 11 9 9 4 4 4
C
LS 11 13 11
3 3 3 3
D 8 5 7 B
2 2
TF 0 4 2 D
5 5 5 5 5
R 2 3 4 E
1 1 1
OSS G H F G
4 4 4 4 4 4 4
G &H have
H
smallest 2 2 2 2 2 2 2 2
value Among
F,G,H, but G
has least
activity
duration.
Enough
resources are Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
UR 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6
not available 2 2 2 3 3 3 3 1 1 1 1 1 2 2 2 2 2 2 2 4
for activity F. 1 1 0 0 0 0 0 0 0 0 0 0
AR 4 4 4 5 5 3 3 6 6 6 5 5 6 6 6 6 6 6 6 2
Activity Predecessor A B D D D D H H H F F F F F F F Y
Y H
EAS C E F
D G
A C D G F Y
EAS F Y OSS B E H
D F
ES 9 19 A
LS 13 19 4 4 4
C
D 5 1
3 3 3 3
B
TF 4 0
2 2
R 3 3 D
5 5 5 5 5
OSS F E
1 1 1
G
4 4 4 4 4 4 4

H
2 2 2 2 2 2 2 2

F
3 3 3 3 3

Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
UR 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6
2 2 2 3 3 3 3 1 1 1 1 1 2 2 2 2 2 2 2 4 3 3 3 3
1 1 0 0 0 0 0 0 0 0 0 0 1
AR 4 4 4 5 5 3 3 6 6 6 5 5 6 6 6 6 6 6 6 5 3 3 3 3
 A B D D D D H H H F F F F F F F Y Z
Activity Predecessor EAS C E F
Z F,G D G
A C D G F Y Z
OSS B E H
EAS Y Z D F
A
ES 19 16
4 4 4
LS 19 18 C
D 1 2 3 3 3 3
B
TF 0 2 2 2
D
R 3 2 5 5 5 5 5
E
OSS Y 1 1 1
G
4 4 4 4 4 4 4

H
2 2 2 2 2 2 2 2

F
3 3 3 3 3
Y
3

Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
UR 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6
2 2 2 3 3 3 3 1 1 1 1 1 2 2 2 2 2 2 2 4 3 3 3 3
1 1 0 0 0 0 0 0 0 0 0 0 1 0
AR 4 4 4 5 5 3 3 6 6 6 5 5 6 6 6 6 6 6 6 5 6 3 3 3
Activity Predecessor A B D D D D H H H F F F F F F F Y Z X
EAS C E F
X Y,Z
D G
EAS Z X A C D G F Y Z
OSS B E H
ES 16 20 D F
LS 18 20 A
4 4 4
D 2 5
C
TF 2 1
3 3 3 3
B
R 2 1 2 2
D
OSS Z 5 5 5 5 5
E
1 1 1
G
4 4 4 4 4 4 4

H
2 2 2 2 2 2 2 2

F
3 3 3 3 3
Y
3
Z
2 2
Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
UR 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6
2 2 2 3 3 3 3 1 1 1 1 1 2 2 2 2 2 2 2 4 3 3 3 3 4 4
1 1 0 0 0 0 0 0 0 0 0 0 1 0
AR 4 4 4 5 5 3 3 6 6 6 5 5 6 6 6 6 6 6 6 5 6 3 3 3 2 2
 A B D D D D H H H F F F F F F F Y Z X
EAS X EAS C E F
ES 20 D G
A C D G F Y Z X
LS 20
OSS B E H
D 5 D F
TF 1 A Activity Predecessor
R 1
4 4 4
C A -
OSS X 3 3 3 3 B A
B C A
2 2
D A
D
5 5 5 5 5 E B,C
E F D
1 1 1 G D
G
4 4 4 4 4 4 4 H E
H Y H
2 2 2 2 2 2 2 2 Z F,G
F
X Y,Z
3 3 3 3 3
Y
3
Z
2 2
X
1 1 1 1 1

Day 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
UR 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6
2 2 2 3 3 3 3 1 1 1 1 1 2 2 2 2 2 2 2 4 3 3 3 3 4 4 5 5 5 5 5
1 1 0 0 0 0 0 0 0 0 0 0 1 0
AR 4 4 4 5 5 3 3 6 6 6 5 5 6 6 6 6 6 6 6 5 6 3 3 3 2 2 1 1 1 1 1
So minimum contract duration will be 31 days if
no more than 6 labours can be made available for
the work and started an activity it must be
completed without a break.