Scribd
Upload
354 views5 pages

Assignment 4 - Solution PDF

This document provides instructions for CE413 Construction Methods Assignment #4, which includes 4 problems to solve using different scheduling techniques: 1) Parallel resource scheduling with limits of 5M and 2H. 2) Series resource scheduling using the series method with limits of 4C and 3L. 3) Network scheduling using the Brooks method with a limit of 6 resources. 4) Leveling resources for a network using the minimum-moment algorithm procedure.

Uploaded by

ASMAT KHAN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
354 views5 pages

Assignment 4 - Solution PDF

This document provides instructions for CE413 Construction Methods Assignment #4, which includes 4 problems to solve using different scheduling techniques: 1) Parallel resource scheduling with limits of 5M and 2H. 2) Series resource scheduling using the series method with limits of 4C and 3L. 3) Network scheduling using the Brooks method with a limit of 6 resources. 4) Leveling resources for a network using the minimum-moment algorithm procedure.

Uploaded by

ASMAT KHAN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

CE413 Assignment #4

CE413
CONSTRUCTION METHODS
Due 11/9/2020 (by 10:00 AM)

1. Solve the following by the parallel method of resource allocation. The resource limits are as
follows: 5M and 2H. (20 points)

Act Resource Dur TF LS / 1 2 3 4 5 6 7 8 9 10 11 12


A 2M 1H 1 0 1 / A
B 2M 1H 4 0 2 / B B B B
C 2M 1H 1 1 3 / C
D 1M 1 0 6 / D
E 3M 2 0 6 / E E
F 3M 2 2 5 / F F
G 1M 2H 3 1 4 / G G G
H 1M 1H 2 2 5 / H H
I 2M 1H 1 0 7 / I
J 2M 1H 1 0 8 / J
K 3M 1H 2 1 7 / K K
L 2M 1H 1 0 9 / L
CE413 Assignment #4

2. Solve this resource scheduling problem with the series method. The resource limits are as
follows: 4C and 3L. Note: Activities A, D, and J have no resource requirements. (20 points)

Resource
Act Dur TF LS / 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
C L
A 0 0 1 0 1 / A
B 3 2 2 0 2 / B B
C 1 3 4 0 4 / C C C C
D 0 0 3 12 14 / D D D
E 2 0 2 8 12 / E E
F 0 2 3 0 8 / F F F
G 2 3 2 0 11 / G G
H 1 1 3 8 14 / H H H
I 0 1 6 11 13 / I I I I I I
J 0 0 2 12 17 / J J
K 1 2 6 0 13 K K K K K K
L 2 1 2 8 17 / L L
M 1 0 1 0 19 M
CE413 Assignment #4

3. Solve the following network by the Brooks method. The resource limit is 6. (20 points)

ACT A D B C F G E I H J
ACTIM 21 20 17 16 14 10 9 7 4 1

ACT A D B C F G E I H J
Duration 1 6 3 2 7 3 5 6 3 1
Prec. By ‐ A A A B,C,D D B F,G E,F H,I
H needed 2 1 4 3 1 5 4 1 6 1
Tstart 1 2 2 5 8 12 7 15 21 24
Tfin 2 8 5 7 15 15 12 21 24 25

Tnow 1 2 5 7 8 12 15 21 24
H avail. 6 6 6 6 6 6 6 6 6
Act. Ready A D,B,C D,C,E D,E F,G,E F,G I,H H J
Act. Sched A D,B D,C D,E E,F F,G I H J
H in use 2 5 4 5 5 6 1 6 1
CE413 Assignment #4

4. Level the resources (R) for the following network by the minimum-moment algorithm
procedure. (40 points)
CE413 Assignment #4

You might also like