PROBABILITY THEORY AND OPTIMIZATION

Subject Code: 21MAT41D

Module 3
NETWORK MODEL
Q.NO Question CO BT Marks
1. Define what a network is. Explain Dijkstra’s path algorithm. 3 2 10

2. Use Dijkstra’s algorithm to determine a shortest path problem from A to C for the 3 3 10
following network.

3. The network given below gives the permissible routes and their lengths in miles 3 4 10
between stations of city 1 (nose 1) and six other cities (2-7).

Determine the shortest route and hence the shortest distance from city 1 to city 7.
4. Consider the network given below: 3 4 10

The distance (in miles) between different stations is shown on each link. Determine the
shortest route from stations 1 to station 8.

Page 1 of 8
5. a) Distinguish between PERT and CPM techniques 3 2 6
b) Define optimistic time, most likely time, pessimistic time, and expected time. 3 2 6
6. Listed in the table are the activities and sequencing necessary for a maintenance job 3 4 10
on the heat exchangers in a refinery.
Activity Descriptions Precedence
Activity
A Dismantle pipe connections -

B Dismantle header, closure, and floating front A

C Remove tube bundle B

D Clean bolts B

E Clean header and floating head front B

F Clean tube bundle C

G Clean shell C

H Replace tube bundle F,G

I Prepare shell pressure test D,E,H

J Prepare tube pressure test and re-assemble I

Then Draw the network diagram for the project.
7. Draw the network for the following data 3 3 10
Activity A B C D E F G H I
Preceding - A A B A B,E C D,F G
activity

8. a) Explain the following terms: 3 2 5

i. Earliest time
ii. Latest time
iii. Critical path

b) What are the rules for drawing network diagram? Also mention the common 3 2 6
errors that occur in drawing networks.
9. Determine early start (TE) and late start (TL) in the respect of all the node points and 3 4
10
identify the critical path in respect of the following network.

Page 2 of 8
10. Draw the network for the following data 3 3 10

Activity A B,C D E F G
Preceding - A B,C C D,E E,F
activity

11. Draw network for jobbing production and indicate the critical path 3 4 10
Activity Descriptions Precedence Time
Activity (weeks)
A Market research - 15

B Make drawings - 15

C Decide production policy A 3

D Prepare sales program A 5

E Prepare operation sheets B,C 8

F Buy materials B,C 12

G Plan labour force E 1

H Make tools E 14

I Schedule production D,G 3

J Produce product F,H,I 14

Page 3 of 8
12. Draw network for jobbing production and indicate the critical path and total float of 3 4 10
activities.

Activity Precedence Time

Activity (Days)
A - 13

B A 8

C B 10

D C 9

E B 11

F E 10

G D,F 8

H E 6

I H 7

J G,I 14

K J 18
13. A company has listed the following activities in launching a new product 3 4 10
Activity Precedence Time
Activity (Days)
A - 6

B A 5

C B 3

D C 2

E B 3

F E 2

G D,F 4

H E 2

Page 4 of 8
 i. Draw the project actives
ii. Find the critical path
14. Table below shows jobs, their normal time and cost, and crash time and cost of a 3 4 10
project
Job Normal Time Cost Crash Time Crash Cost
(Days) (Days)
(1-2) 6 1400 4 1900
(1-3) 8 2000 5 2800
(2-3) 4 11000 2 1500
(2-4) 3 800 2 1400
(3-4) Dummy - - -
(3-5) 6 900 3 1600
(4-6) 10 2500 6 3500
(5-6) 3 500 2 800
i) Draw the activity network of the project.
ii) What is the normal duration cost of the project?
iii) If all activities are crashed, what will be the project duration and corresponding
cost?
iv) Find the optimum duration and minimum project cost.

15. For the project represented by the network diagram, find the earliest and latest time to 3 4 10
reach each node, given the following data
Task A B C D E F G H I J K
Least time 4 5 8 2 4 6 8 5 3 5 6
Greatest Time 8 10 12 7 10 15 16 9 7 11 13
Most Likely 5 7 11 3 7 9 12 6 5 8 9
Time

Page 5 of 8
16. A project has the following characteristics. 3 3 10
Job Most optimistic Most pessimistic Most likely time
time tine
(1-2) 1 5 1.5
(2-3) 1 3 2
(2-4) 1 5 3
(3-5) 3 5 4
(4-5) 2 4 3
(4-6) 3 7 5
(5-7) 4 6 5
(6-7) 6 8 7
(7-8) 2 6 4
(7-9) 5 8 6
(8-10) 1 3 2
(9-10) 3 7 5
Construct a PERT network.
17. Obtain the critical path and project duration for the following PERT diagram. 3 3 10

Page 6 of 8
18. A project is represented by the network below and has the following data: 3 4 10

Task A B C D E F G H I
Least time 5 18 26 16 15 6 7 7 3
Greatest Time 10 22 40 20 25 12 12 9 5
Most Likely 8 20 33 18 20 9 10 8 4
Time

Determine the following

(i) expected task time and their variance,
(ii) the earliest and latest expected times to reach each node,
(iii) the critical path, and
1. (iv) the probability of node occurring at the proposed completion date if the original
contract time of completing the project is 41.5 weeks Solution.

Page 7 of 8
19. The following table list the job of the network with their estimates. 3 4 10
Job Duration (Days)
optimistic (t0) Most likely time(tm) Pessimistic(tp)
(1-2) 3 6 15
(1-6) 2 5 14
(2-3) 6 12 30
(2-4) 2 5 8
(3-5) 5 11 17
(4-5) 3 6 15
(6-7) 3 9 27
(5-8) 1 4 7
(7-8) 4 19 28

(i) Draw the project network

(ii) Calculate the length and variance of the critical path
(iii) What is the approximate probability that the jobs on the critical path will be
completed in 41 days?

20. In the network shown below. The estimates of t0 , tm, tp are shown this order for each 3 4 10
of the activities on the top of the arcs denoting the respective activities. Find the
probability of completing the project in 25 days.

Page 8 of 8