Scribd
Upload
724 views

MTH601 - (Assignment No.1)

The document outlines the requirements and solution for an operations research assignment involving project scheduling. It includes: 1. A table showing the relationships between activities and their predecessors. 2. The calculation of earliest start time (EST), earliest finish time (EFT), latest start time (LST), and latest finish time (LFT) for each activity. 3. The calculation of total float for each activity as the difference between LST-EST or LFT-EFT. 4. Identification of the critical path as activities A-C-F-I totaling 17 days. 5. The project completion time is given as 17 days.

Uploaded by

Asif Mahmood
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
724 views

MTH601 - (Assignment No.1)

The document outlines the requirements and solution for an operations research assignment involving project scheduling. It includes: 1. A table showing the relationships between activities and their predecessors. 2. The calculation of earliest start time (EST), earliest finish time (EFT), latest start time (LST), and latest finish time (LFT) for each activity. 3. The calculation of total float for each activity as the difference between LST-EST or LFT-EFT. 4. Identification of the critical path as activities A-C-F-I totaling 17 days. 5. The project completion time is given as 17 days.

Uploaded by

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

_________________________________________________________________________________

MTH601 - Operations Research


Assignment No.1
Requirement – 1. Construct a table which shows the relationship between the activities and their
predecessors.

EST=7
LFT=9
S=2

EST=0
LFT=0
S=0

EST=8 EST=14
EST=3 LFT=8 EST=17
LFT=3 S=0 LFT=14 LFT=17
S=0 S=0
S=0

EST=5 EST=9
LFT=11 LFT=15
S=6 S=0

Requirement – 2. Calculate the following time estimates for each activity.


a. Earliest Start Time (EST)
b. Earliest Finish Time (EFT)
c. Latest Start Time (LST)
d. Latest Finish Time (LFT)
Requirement – 3. Calculate the total float for each activity.
TF = LST – EST or LFT - EFT

Solution.
TF = LST – EST
Activity Nodes Predecessor Duration EST EFT LST LFT or LFT - EFT

A 1-2 - 3 0 3 0 3 0
B 2-3 A 4 3 7 5 9 2
C 2-5 A 5 3 8 3 8 0
D 2-4 A 2 3 5 9 11 6
E 3-7 B 3 7 10 11 14 4
F 5-7 C, D 6 8 14 8 14 0
G 4-6 D 4 5 9 11 15 6
H 3-8 B 8 7 15 9 17 2
I 7-8 E, F, G 3 14 17 14 17 0
J 6-8 G 2 17 19 15 17 -2

Requirement – 4. Identify the critical path.


Solution.

CP = 1 - 2 - 5 - 7 – 8
CP = A – C – F – I
CP = (3 + 5 + 6 + 3) x Days
_________________________________________________________________________________

CP = 17 x Days

Requirement – 5. Find the project completion time.


Solution.
Project completion time = 17 Days

You might also like