b)

a)

b)

H1122 Pages: 4

Department B - is finishing. The table below lists the number of days required by
each job in each department.

70൧1] 1002 063
DepartmentA : 8 6 5
DepartmentB : 8 3 4

Find the sequence in which three jobs should be processed so as to take minimum
time to finish all the three jobs. Find i) the minimum total time.

ii) the idle time of both departments

Solve the following transhipment problem (8)

51 52 D1 D2 supply

51 |: | ¦ |? 2 1 8
52 1 2 3 3
D1 2 0 2
02 1 2 0
7 4
PART C
Answer any two full questions, each carries 20 marks
The following table lists the jobs of a network along with their time estimates. (10)
Job (1-7) : 1-2 1-6 2-3 2-4 3-5 45 5-8 6-7 7-8
Duration ಗೃ ತಿ 2 6 2 5 3 1 3 4
t, : 6 5 12 5 11 6 4 9 19
t : 15 14 30 8 17 15 7 27 28

(i) Draw the project network and calculate the length and variance of the critical
path.

(ii) What is the probability that the jobs on the critical path will be completed in
41 days?

(iii) What is the probability that the jobs on the critical path will be completed in
34 days?
Find the shortest path E to F for the following graph using Dijkstra’salogorithm. (10)
A 9 B
18 >

Page 3084