Scribd
Upload
12 views

Assignment 8

The document presents three critical path method (CPM) problems to solve. The first problem involves activities A through N with various predecessors and durations. It asks for the minimum time to complete the project, the critical path, and slack values. The second problem involves activities A through H and asks the same questions. The third problem involves activities A through I and asks to solve it using linear programming to find the minimum time.

Uploaded by

Jackline Khoury
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

Assignment 8

The document presents three critical path method (CPM) problems to solve. The first problem involves activities A through N with various predecessors and durations. It asks for the minimum time to complete the project, the critical path, and slack values. The second problem involves activities A through H and asks the same questions. The third problem involves activities A through I and asks to solve it using linear programming to find the minimum time.

Uploaded by

Jackline Khoury
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

55815 Quantitative Models

Exercise 8

1. Consider the following CPM problem:

Activity Immediate Predecessor Time


A - 10
B - 3
C - 1
D - 2
E D 7
F E 3
G A,F 5
H G 4
I B,H 4
J B,H 3
K I,J 6
L G 3
M C,I 4
N K,L 7

a) What is the minimum time to complete this project? You can solve it using PERT
chart or a table
b) What is the critical path?
c) What are the slack values of all activities?

2. Consider the following CPM problem:

Activity Immediate Predecessor Time


A - 1
B - 5
C D,G 8
D A 4
E D,G 9
F G 2
G A,B 6
H A 3

a) What is the minimum time to complete this project? You can solve it using PERT
chart or a table

1
Lecture 8. Project Management

b) What is the critical path?


c) What are the slack values of all activities?

3. (**Optional question - You can refer to the lecture notes and the Excel file where I
demonstrated the solution.) Consider the following CPM problem:

Activity Immediate Predecessor Time


A D,E 2
B - 8
C D,E,F 5
D G 3
E B,G 6
F G 2
G - 7
H B 4
I H 9

Solve using linear programming and Find the minimum time to complete the project.

Quantitative models 2 Amir Brudner

You might also like