Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Time: 90 min
Max. Marks: 50
Sour
ce
A
15
80
90
1
2
3
Dema
nd
23
Destinations
B
C
51
42
42
26
40
66
31
16
D
33
81
60
Supply
23
44
33
30
5
7
6
5
3
9
4
7
2
2
5
7
8
6
7
8
5. (Maximization problem) A Company has four territories open and four salesmen available for
assignment. The territories are not equally rich in their sales potential: It is estimated that a typical
salesman opening in each territory would bring in the following annual sales:
Territory
I
II
III
IV
Annual
60,00
50,00
40,00
30,00
sales(Rs)
0
0
0
0
Four salesmen are also considered to differ in their ability: it is estimated that, working under the
same conditions, their yearly sales would be proportionality as follows:
Salesman
Proportion
A
7
B
5
C
5
D
4
If the criterion is maximum expected total sales, then intuitive answer is to assign the best salesman to
the richest territory and the next best salesman to the second richest and so on. Verify this answer by
the assignment techniques.
6. Solve the travelling salesman problem given by the following data
C12=20,C13=4,C14=10,C23=5,C34=6 and C25=10,C35=6,C45=20 where Cij=Cji and there is no route
between cities i and j if the value for Cij is not shown
7. a) Explain the method of processing n jobs through three machines A,B,C in the order of ABC
b) Six jobs got first over machine I and then over machine II.The order of completion of jobs have
no significance .The following gives the machine times in hour for six jobs and then two machines.
Job
Machine
I
Machine
II
Find the sequence of jobs that minimises the total elapsed time to complete the jobs
8. A machine operator has to perform three machines turning, threading and knurling on a number of
different jobs. The time required to perform these operation (in Minutes) for each job is known.
Determine the order in which the jobs should be processed in order to minimize the total time required
to turn out all the jobs. Also find the minimum elapsed time.
Job
Turning
Threadi
ng
Knurlin
g
1
3
2
12
3
5
4
2
5
9
6
11
13
14
12
13
----------------------------------------------------------------------------------------------------------------------