Scribd
Upload
253 views

Network Diagram

The document provides information on multiple network diagrams, including activities, durations, and precedence relationships. It asks the reader to: 1) Draw network diagrams based on the information provided 2) Determine the critical path/s and calculate the duration/s 3) Calculate early start, early finish, late start, late finish, and total float The document provides step-by-step explanations for constructing network diagrams and identifying critical paths based on the data. Tables with tabulated data such as early/late dates are also included.

Uploaded by

John Robert Gabriel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
253 views

Network Diagram

The document provides information on multiple network diagrams, including activities, durations, and precedence relationships. It asks the reader to: 1) Draw network diagrams based on the information provided 2) Determine the critical path/s and calculate the duration/s 3) Calculate early start, early finish, late start, late finish, and total float The document provides step-by-step explanations for constructing network diagrams and identifying critical paths based on the data. Tables with tabulated data such as early/late dates are also included.

Uploaded by

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

NETWORK DIAGRAM

(PERT/CPM)
CE514C
NUMBER THE EVENTS OF THE FOLLOWING NETWORKS IN PROPER SEQUENCE.

END
START  
 
2  4
END
START  1 6
 

3 5
CONSTRUCT A NETWORK DIAGRAM FROM THE
FOLLOWING INFORMATIONS:

ESTIMATED
TIME
ACTIVITY PRECEDES
(WEEKS)
a b 15
b c,d 13
c e 8
d end 5
e end 3
4
c=13 e=8
START
END
a=15
1 2 3  
b=13 5
d=5
Construct a Network Diagram from the following
informations:
ESTIMATED
ACTIVITY PRECEDES TIME
(WEEKS)
f g,h 10
g i 10
h j 8
i end 6
j k 12
k end 7
i=6
END
g=10  
START
  f=10
k=7

h=8
j=12
Using the following information, perform the
following.
• Network Diagram
• Determine which activities are on the critical path
• Compute the length of the critical path
ACTIVITY ESTIMATED TIME (DAYS)
1-2 5
2-3 6
2-4 4
3-6 10
6-7 3
4-5 5
4-7 16
5-7 10
10
3 6
6
3
1 5 2
16 7
4

4 10
5
5
10
3 6
6
3
1 5 2
16 7
4

4 10
5
5
DETERMINING CRITICAL PATH:

PATH 1:
*1–2–3–6–7
= 5 + 6 + 10 + 3 = 24
10
3 6
6
3
1 5 2
16 7
4

4 10
5
5
DETERMINING CRITICAL PATH:

PATH 2:
*1–2–4–5–7
= 5 + 4 + 5 + 10 = 24
10
3 6
6
3
1 5 2
16 7
4

4 10
5
5
DETERMINING CRITICAL PATH:

PATH 3:
*1–2–4–7 CRITICAL PATH
= 5 + 4 + 16 = 25
EF = ES + D TF = 1
LS = LF – D
TF = LF – EF TF = 1 11 21
TF = LS –ES TF = 1
5 11 12 22
TF = 0 21 24
6 12
0 5 10 22 25
3 6
0 5 6 TF = 0
3
9 25
1 2
5 9 25
4 7
TF = 0
5 9 16 10
4 TF = 1
5 9
5 14 24
LEGENDS: 5
TF 9 14 15 25
ES EF TF = 1
LS LF 10 15
TABULATED DATA:

  EARLY EARLY LATE LATE TOTAL


ACTIVITY DURATION START FINISH START FINISH FLOAT
(IN DAYS) (ES) (EF) (LS) (LF) (TF)
1-2 5 0 5 0 5 0
2-3 6 5 11 6 12 1
2-4 4 5 9 5 9 0
3-6 10 11 21 12 22 1
6-7 3 21 24 22 25 1
4-5 5 9 14 10 15 1
4-7 16 9 25 9 25 0
5-7 10 14 24 15 25 1
FROM THE FOLLOWING TABLE OF INFORMATION.
Draw a Precedence Diagram
Find the Critical Path
Determine the expected duration of the project.
ACTIVITY PRECEDES EXPECTED TIME
(DAYS)
a c, b 4
c d 12
d i 2
b i 5
e f 3
f j 8
i j 12
j end 9
g h 1
h k 3
k end 15
d=2
c=12

START b=5 i=12


  a=4

e=3
f=8
j=9
g=1

h=3
k=15
END
FROM THE DATA GIVEN IN THE TABLE, CALCULATE
THE CRITICAL PATH & IT’S DURATION
ACTIVITY TIME (DAYS)
1–2 4
1–3 1
2–4 1
3–4 1
3–5 6
4–9 5
5–6 4
5–7 8
6–8 1
7–8 2
8 – 10 5
9 - 10 7

You might also like