Operations Research

CHAPTER 4

ASSIGNMENT

Number of origins is equal to number of destinations, at each origin always one unit is
available and always one unit is required at each of the destinations. Cost or profit
matrix is always square. Here tasks can be assigned to only one facility.

Assignment Algorithm – Hungarian method

(i) Mark all rows for which assignment have not been made.
(ii) Mark columns not already marked which have zeros in marked rows.
(iii) Mark rows not already marked which have assignments in marked columns.
(iv)Repeat (ii) and (iii) until the chain of marking ends.
(v) Draw minimum number of lines through all unmarked rows and through all
marked columns to cover all the zeros.

Assignment Algorithm – Penalty method

Worked Examples

1) Find an optimal solution to an assignment problem using Hungarian method

Operators
1 2 3 4 5
1 10 12 15 12 8
2 7 16 14 14 11
Jobs 3 13 14 7 9 9
4 12 10 11 13 10
5 8 13 15 11 15

Solution: Method 1

Operators
1 2 3 4 5
1 2 4 7 4 0
2 0 9 7 7 4
Jobs 3 6 7 0 2 9
4 2 0 1 3 0
5 0 5 7 3 7

1
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

Operators
1 2 3 4 5
1 2 4 7 2 [0]
2 [0] 9 7 5 4
Jobs 3 6 7 [0] 0 9
4 2 [0] 1 1 0
5 0 5 7 1 7

Operators
1 2 3 4 5
1 2 4 6 1 [0]
2 [0] 9 6 4 4
Jobs 3 7 8 [0] 0 10
4 2 [0] 0 0 0
5 0 5 6 [0] 7

1 – 5, 2 – 1, 3 – 3, 4 – 2, 5 – 4, Cost = 8 + 7 + 7 + 10 + 11 = 43

Method 2:

Operators
1 2 3 4 5
1 2 4 7 2
2 [ ] 9 7 5 4
Jobs 3 6 7 9
4 2 1 1
5 5 7 1 7

Operators
2 3 4 5
1 4 7 2 0
Jobs 3 7 0 0 9
4 0 1 1 0
5 5 7 1 7

Operators
2 3 4 5
1 4 7 2
Jobs 3 7 9
4 [ 1 1

2
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

]
5 4 6 6

Operators
3 4 5
1 7 2 [
]
Jobs 3 9
5 6 6

Operators
3 4
Jobs 3 [
]
5 6 [ ]

1 – 5, 2 – 1, 3 – 3, 4 – 2, 5 – 4, Cost = 8 + 7 + 7 + 10 + 11 = 43

2) Solve the following assignment problem

A B C D E
1 1 3 2 3 6
2 2 4 3 1 5
3 5 6 3 4 6
4 3 1 4 2 2
5 1 5 6 5 4

Solution:

A B C D E
1 0 2 1 2 5
2 1 3 2 0 4
3 2 3 0 1 3
4 2 0 3 1 1
5 0 4 5 4 3

A B C D E
1 [0] 2 1 2 4
2 1 3 2 [0] 3

3
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

3 2 3 [0] 1 2
4 2 [0] 3 1 0
5 0 4 5 4 2

A B C D E
1 [0] 0 1 2 2
2 1 1 2 [0] 1
3 2 1 [0] 1 0
4 4 [0] 5 3 0
5 0 2 5 4 [0]

or

A B C D E
1 0 [0] 1 2 2
2 1 1 2 [0] 1
3 2 1 [0] 1 0
4 4 0 5 3 [0]
5 [0] 2 5 4 0

1 – A, 2 – D, 3 – C, 4 – B, 5 – E or 1 – B, 2 – D, 3 – C, 4 – E, 5 – A
Cost = 1 + 1 + 3 + 1 + 4 = 10

3) Solve the following minimal assignment problem

I II III IV V
A 11 17 8 16 20
B 9 7 12 6 15
C 13 16 15 12 16
D 21 24 17 28 26
E 14 10 12 11 15

Solution:

I II III IV V
A 3 9 0 8 12
B 3 1 6 0 9
C 1 4 3 0 4
D 4 7 0 11 9
E 4 0 2 1 5

4
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

I II III IV V
A 2 9 [0] 8 8
B 3 1 6 [0] 5
C [0] 4 3 0 0
D 3 7 0 11 5
E 3 [0] 2 1 1

I II III IV V
A 1 9 [0] 8 7
B 2 1 6 [0] 4
C [0] 5 4 1 0
D 2 7 0 11 4
E 2 [0] 2 1 0

I II III IV V
A [0] 8 0 8 6
B 1 0 6 [0] 3
C 0 5 5 2 [0]
D 1 6 [0] 11 3
E 2 [0] 3 2 0

A – I, B – IV, C – V, D – III, E – II, Minimum cost =11 + 6 + 16 + 17 + 10 = 60

4) Solve the following minimal assignment problem

I II III IV
A 11 17 8 16
B 9 7 12 6
C 13 16 15 12
D 21 24 17 28

Solution:

I II III IV
A 3 9 0 8
B 3 1 6 0
C 1 4 3 0
D 4 7 0 11

5
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

I II III IV
A 2 8 [0] 8
B 2 [0] 6 0
C [0] 3 3 0
D 3 6 0 11

I II III IV
A [0] 6 0 6
B 2 [0] 8 0
C 0 3 5 [0]
D 1 4 [0] 9

A – I, B – II, C – IV, D – III, Minimum cost =11 + 7 + 12 + 17 = 47

5) Solve the following minimal assignment problem.

A B C D E F
1 31 62 29 42 15 41
2 12 19 39 55 71 40
3 17 29 50 51 22 22
4 35 40 38 42 27 33
5 19 30 29 16 20 23
6 72 30 30 50 41 20

Solution:

A B C D E F
1 16 47 14 27 0 26
2 0 7 27 43 59 28
3 0 12 33 34 5 5
4 8 13 11 15 0 6
5 3 14 13 0 4 7
6 52 10 10 30 21 0

A B C D E F
1 16 40 4 27 [0] 26
2 0 [0] 17 43 59 28
3 [0] 5 23 34 5 5
4 8 6 1 15 0 6
5 3 7 3 [0] 4 7

6
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

6 52 3 [0] 30 21 0

A B C D E F
1 16 39 3 27 [0] 25
2 1 [0] 17 44 60 28
3 [0] 4 22 34 5 4
4 8 5 [0] 15 0 5
5 3 6 2 [0] 4 6
6 53 3 0 31 22 [0]

1 – E, 2 – B, 3 – A, 4 - C, 5 – D, 6 – F, Cost = 25 + 29 + 27 + 48 + 26 + 30 = 185

6) Solve the following maximization problem by assignment method

P Q R S
A 56 35 49 21
B 40 25 35 15
C 32 20 28 12
D 24 15 21 9

Solution:

P Q R S
A 0 21 7 35
B 16 31 21 41
C 24 36 28 44
D 32 41 35 47

P Q R S
A 0 21 7 35
B 0 15 5 25
C 0 12 4 20
D 0 9 3 15

P Q R S
A [0] 12 4 20
B 0 6 2 10
C 0 3 1 5
D 0 [0] 0 0

7
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

P Q R S
A [0] 11 3 19
B 0 5 1 9
C 0 2 [0] 4
D 1 [0] 0 0

P Q R S
A [0] 9 3 17
B 0 3 1 7
C 0 0 [0] 2
D 3 0 2 [0]

P Q R S
A [0] 8 2 16
B 0 2 [0] 6
C 1 [0] 0 2
D 4 0 2 [0]

A – P, B – R, C – Q, D – S

7) Find the optimal assignment plan and optimum cost for the following problem.

a b c d e
A 160 130 175 190 200
B 135 120 130 160 175
C 140 110 155 170 185
D 50 50 80 80 110
E 55 35 70 80 105

Solution:

A B C D E
P 160 130 175 190 200
Q 135 120 130 160 175
R 140 110 155 170 185
S 50 50 80 80 110
T 55 35 70 80 105

8
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

A B C D E
P 30 0 45 60 70
Q 15 0 10 40 55
R 30 0 45 60 75
S 0 0 30 30 60
T 20 0 35 45 70

A B C D E
P 30 [0] 35 30 15
Q 15 0 [0] 10 0
R 30 0 35 30 20
S [0] 0 20 0 5
T 20 0 25 15 15

A B C D E
P 15 0 20 15 [0]
Q 15 15 [0] 10 0
R 15 [0] 20 15 5
S [0] 15 20 0 5
T 5 0 10 [0] 0

P – E, Q – C, R – B, S – A, T – D, Cost = 200 + 130 + 110 + 50 + 80 = 570

8) A company has four machines of which to do three Jobs. Each Job can be assigned to
one and only one machine. The cost of each Job on each machine is given in the
following table

Machines
W X Y Z
A 18 24 28 32
Jobs B 8 13 17 18
C 10 15 19 22

How should the jobs be assigned to the machines so as to minimize the cost?
Solution:

W X Y Z
A 18 24 28 32
B 8 13 17 18

9
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

C 10 15 19 22
D 0 0 0 0

W X Y Z
A [0] 6 10 14
B 0 5 9 10
C 0 5 9 12
D 0 [0] 0 0

W X Y Z
A [0] 1 5 9
B 0 [0] 4 5
C 0 0 4 8
D 5 0 [0] 0

W X Y Z
A [0] 1 1 5
B 0 [0] 0 1
C 0 0 [0] 4
D 5 0 0 [0]

W X Y Z
A [0] 1 1 5
B 0 0 [0] 1
C 0 [0] 0 4
D 5 0 0 [0]

A – W, B – X or Y, C – Y or X, Cost = 18 + 13 + 19 = 50

9) The owner of a machine shop has four operators available to assign the jobs for that
day. Five jobs are offered with expected profit for each operators on each job as
follows:

A B C D E
1 60 76 48 99 80
2 69 82 59 71 57

10
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

3 85 90 109 69 79
4 46 62 85 75 78

Determine the optimum assignment schedule. Which job should be declined?

Solution:

A B C D E
1 60 76 48 99 80
2 69 82 59 71 57
3 85 90 109 69 79
4 46 62 85 75 78
5 0 0 0 0 0

Convert the problem to minimization type

A B C D E
1 49 33 61 10 29
2 40 27 50 38 52
3 24 19 0 40 30
4 63 47 24 34 31
5 109 109 109 109 109

A B C D E
1 39 23 51 [0] 19
2 13 [0] 23 11 25
3 24 19 [0] 40 30
4 39 23 0 10 7
5 [0] 0 0 0 0

A B C D E
1 32 23 51 [0] 12
2 6 [0] 23 11 18
3 17 19 [0] 40 23
4 32 23 0 10 [0]
5 [0] 7 7 7 0

Operators Jobs Profit

1 D 99
2 B 82
3 C 109
4 E 78

11
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

Total profit 368

Job A should be declined.

10) The owner of a machine shop has four operators available to assign the jobs for that
day. Five jobs are offered with expected profit for each operators on each job which
are as follows:

Jobs
A B C D E
1 62 78 50 111 82
Operators 2 71 84 61 73 59
3 87 92 111 71 81
4 48 64 87 77 80

Find by using assignment method the assignment of operators for the job that will
result in maximum profit. Which job should be declined?
Solution:

A B C D E
1 62 78 50 111 82
2 71 84 61 73 59
3 87 92 111 71 81
4 48 64 87 77 80
5 0 0 0 0 0

Convert the problem to minimization type

A B C D E
1 49 33 61 0 29
2 40 27 50 38 52
3 24 19 0 40 30
4 63 47 24 34 31
5 111 111 111 111 111

A B C D E
1 49 33 61 [0] 29
2 13 [0] 23 11 25
3 24 19 [0] 40 30
4 39 23 0 10 7
5 [0] 0 0 0 0

12
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

A B C D E
1 42 33 61 [0] 22
2 6 [0] 23 11 18
3 17 19 [0] 40 23
4 32 23 0 10 [0]
5 [0] 7 7 7 0

Operators Jobs Profit

1 D 111
2 B 84
3 C 111
4 E 80
Total profit 386

Job A should be declined

11) One car is available at each of the stations 1, 2, 3, 4 and 5 and one car is required at
each of the stations at A, B, C, D and E. The distances between the various stations
are given below. How should the cars be dispatched so as to minimize the total
mileage travelled?

A B C D E
1 42 72 39 52 25
2 22 29 49 65 81
3 27 39 60 51 32
4 45 50 48 52 37
5 29 40 39 26 30

Solution:

A B C D E
1 17 47 14 27 0
2 0 7 27 43 59
3 0 12 33 24 5
4 8 13 11 15 0
5 3 14 13 0 4

A B C D E
1 17 40 3 27 [0]
2 0 [0] 16 43 59

13
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

3 [0] 5 22 24 5
4 8 6 [0] 15 0
5 3 7 2 [0] 4

12) Five jobs are to be processed and five machines are available, any machine can
process any job with the resulting profit in as follows.

A B C D E
1 32 38 40 28 40
2 40 24 28 21 36
3 41 27 33 30 37
4 22 38 41 36 36
5 29 33 40 35 39

What is the maximum profit that may be expected if an optimum assignment is made?
Solution: Convert the problem to minimization type

A B C D E
1 9 3 1 13 1
2 1 17 13 20 5
3 0 14 8 11 4
4 19 3 0 5 5
5 12 8 1 6 2

A B C D E
1 8 2 0 12 0
2 0 16 12 19 4
3 0 14 8 11 4
4 19 3 0 5 5
5 11 7 0 5 1

A B C D E
1 8 [0] 0 7 0
2 [0] 14 12 14 4
3 0 12 8 6 4
4 19 1 [0] 0 5
5 11 5 0 [0] 1

or

14
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

A B C D E
1 8 [0] 0 7 0
2 [0] 14 12 14 4
3 0 12 8 6 4
4 19 1 0 [0] 5
5 11 5 [0] 0 1

A B C D E
1 9 0 1 8 0
2 0 13 12 14 3
3 0 11 8 6 3
4 20 1 1 1 5
5 11 4 0 0 0

A B C D E
1 9 [0] 1 8 0
2 [0] 13 12 14 3
3 0 11 8 6 3
4 19 0 [0] 0 4
5 11 4 0 0 [0]

A B C D E
1 12 3 1 8 0
2 [0] 13 9 11 0
3 0 11 5 3 0
4 22 3 [0] 0 4
5 14 7 0 0 [0]

A B C D E
1 12 [0] 1 8 0
2 [0] 10 9 11 0
3 0 8 5 3 [0]
4 22 0 [0] 0 4
5 14 4 0 [0] 0

1 – B, 2 – A, 3 – E, 4 – C, 5 – D

15
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

Maximum profit = 38 + 40 + 37 + 41 + 35 = 191

13) There are 5 jobs to be assigned, one each to five machines and the associated cost matrix is as
follows. Find the optimum assignment of jobs and the minimum total cost to process all the
jobs.

Machine
P Q R S T
1 11 17 8 16 20
2 9 7 12 6 15
Job 3 13 16 15 12 16
4 21 24 17 28 26
5 14 10 12 11 15

Solution:

P Q R S T
1 3 9 0 8 12
2 3 1 6 0 9
3 1 4 3 0 4
4 4 7 0 11 9
5 4 0 2 1 5

P Q R S T
1 2 9 [0] 8 8
2 3 1 6 [0] 5
3 [0] 4 3 0 0
4 3 7 0 11 5
5 3 [0] 2 1 1

P Q R S T
1 1 9 [0] 8 7
2 2 1 6 [0] 4
3 [0] 5 4 1 0
4 2 7 0 11 4
5 2 [0] 2 1 0

16
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

P Q R S T
1 [0] 8 0 8 6
2 1 0 6 [0] 3
3 0 5 5 2 [0]
4 1 6 [0] 11 3
5 2 [0] 3 2 0

1 – P, 2 – S, 3 – T, 4 – R, 5 – Q, Minimum cost =11 + 6 + 16 + 17 + 10 = 60

14) A company is faced with the problem of assigning six different machines to five
different jobs. The costs estimated in hundreds of rupees are given in table. Solve the
problem when the objective is to minimize the total cost.

Jobs
1 2 3 4 5
1 2.5 5 1 6 2
2 2 5 1.5 7 3
3 3 6.5 2 8 3
Machines 4 3.5 7 2 9 4.5
5 4 7 3 9 6
6 6 9 5 10 6

Solution:

1 2 3 4 5 6
1 5 10 2 12 4 0
2 4 10 3 14 6 0
3 6 13 4 16 6 0
4 7 14 4 18 9 0
5 8 14 6 18 12 0
6 12 18 10 20 12 0

1 2 3 4 5 6
1 1 [0] 0 0 0 0
2 [0] 0 1 2 2 0
3 2 3 2 4 2 [0]
4 3 4 2 6 5 0
5 4 4 4 6 8 0
6 8 8 8 8 8 0

17
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

1 2 3 4 5 6
1 1 0 0 [0] 0 2
2 [0] 0 1 2 2 2
3 0 1 0 2 [0] 0
4 1 2 [0] 4 3 0
5 2 2 2 4 6 [0]
6 6 6 6 6 6 0

1 2 3 4 5 6
1 1 0 1 [0] 0 3
2 [0] 0 2 2 2 3
3 0 1 1 2 [0] 1
4 0 1 [0] 3 2 0
5 1 1 2 3 5 [0]
6 5 5 6 5 5 0

1 2 3 4 5 6
1 1 0 1 [0] 0 4
2 [0] 0 1 2 2 4
3 0 1 1 2 [0] 2
4 0 1 [0] 3 2 1
5 0 [0] 1 2 4 0
6 4 4 5 4 4 [0]

or

1 2 3 4 5 6
1 1 0 1 [0] 0 4
2 0 [0] 1 2 2 4
3 0 1 1 2 [0] 2
4 0 1 [0] 3 2 1
5 [0] 0 1 2 4 0
6 4 4 5 4 4 [0]

1 – 4, 2 – 1, 3 – 5, 4 – 3, 5 – 2 or 1 – 4, 2 – 2, 3 – 5, 4 – 3, 5 – 1
Minimum cost = 6 + 2 + 3 + 2 + 7 = 20

15) A floor shop is faced with a problem of assigning four operators to four machines.
The assignment cost in is given below:

18
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

Machine
A B C D
1 5 5 -- 2
2 7 4 2 3
Operator 3 9 3 5 --
4 7 2 6 7

Operator 1 cannot be assigned to machine C and operator 3 cannot be assigned to

machine D cannot be assigned. Find the optimal assignment.
Suppose a fifth machine is made available. Its respective assignment costs in to
four operators are 2, 1, 2 and 8. The new machine replaces an existing one, is the
replacement can be justified economically. Reformulate the problem as an assignment
model and find the optimal solution. Is it economical to replace one of the existing
machines? If so, which one?
Solution: (i)

A B C D
1 5 5 ∞ 2
2 7 4 2 3
3 9 3 5 ∞
4 7 2 6 7

A B C D
1 3 3 ∞ 0
2 5 2 0 1
3 6 0 2 ∞
4 5 0 4 5

A B C D
1 [0] 3 ∞ 0
2 2 2 [0] 1
3 3 [0] 2 ∞
4 2 0 4 5

A B C D
1 [0] 4 ∞ 0

19
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

2 1 2 [0] 0
3 2 [0] 2 ∞
4 1 0 4 4

A B C D
1 0 5 ∞ [0]
2 1 3 [0] 0
3 1 [0] 1 ∞
4 [0] 0 3 3

1 – D, 2 – C, 3 – B, 4 – A, Cost = 2 + 2 + 3 + 7 = 14

(ii)

A B C D E
1 5 5 ∞ 2 2
2 7 4 2 3 1
3 9 3 5 ∞ 2
4 7 2 6 7 8
5 0 0 0 0 0

A B C D E
1 3 3 ∞ [0] 0
2 6 3 1 2 [0]
3 7 1 3 ∞ 0
4 5 [0] 4 5 6
5 [0] 0 0 0 0

A B C D E
1 3 4 ∞ [0] 1
2 5 3 [0] 1 0
3 6 1 2 ∞ [0]
4 4 [0] 3 4 6
5 [0] 1 0 0 1

1 – D, 2 – C, 3 – E, 4 – B, Cost = 2 + 2 + 2 + 2 = 8, Replace machine A

20
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

16) Four workers are available to work on 4 machines and the respective cost associated
with each machine - worker assignment is given below.

Machine
M1 M2 M3 M4
W1 12 3 6 --
W2 4 11 -- 5
Workers W3 8 2 10 9
W4 -- 7 8 6

The sign (--) indicates that the particular worker machine assignment is not permitted.
(i) Find the optimum assignment.
(ii) A fifth machine is available to replace one of the existing machine and the
associated costs are as follows: W1 = 5, W2 = 6, W3 = 3 and W4 = 2.
Determine whether the new machine can be accepted and if so, which machine does it
replace?
Solution: (i)

M1 M2 M3 M4
W1 12 3 6 ∞
W2 4 11 ∞ 5
W3 8 2 10 9
W4 ∞ 7 8 6

M1 M2 M3 M4
W1 9 0 3 ∞
W2 0 7 ∞ 1
W3 6 0 8 7
W4 ∞ 1 2 0

M1 M2 M3 M4
W1 9 [0] 1 ∞
W2 [0] 7 ∞ 1
W3 6 0 6 7
W4 ∞ 1 [0] 0

21
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

M1 M2 M3 M4
W1 9 0 [0] ∞
W2 [0] 7 ∞ 0
W3 6 [0] 5 6
W4 ∞ 2 0 [0]

W1 – M3, W2 – M1, W3 – M2, W4 – M4, Cost = 6 + 4 + 2 + 6 = 18

(ii)

M1 M2 M3 M4 M5
W1 12 3 6 ∞ 5
W2 4 11 ∞ 5 6
W3 8 2 10 9 3
W4 ∞ 7 8 6 2
W5 0 0 0 0 0

M1 M2 M3 M4 M5
W1 9 [0] 3 ∞ 2
W2 [0] 7 ∞ 1 2
W3 6 0 8 7 1
W4 ∞ 5 6 4 [0]
W5 0 0 [0] 0 0

M1 M2 M3 M4 M5
W1 9 [0] 2 ∞ 2
W2 [0] 7 ∞ 0 2
W3 6 0 7 6 1
W4 ∞ 5 5 3 [0]
W5 1 1 [0] 0 1

M1 M2 M3 M4 M5
W1 7 0 [0] ∞ 2
W2 [0] 9 ∞ 0 4
W3 4 [0] 5 4 1
W4 ∞ 5 3 1 [0]
W5 1 3 0 [0] 3

W1 – M3, W2 – M1, W3 – M2, W4 – M5

22
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

Cost = 6 + 4 + 2 + 2 = 14, New machine can be accepted which replaces machine 4

17) A company has 5 jobs to be processed on 6 machines. The following table gives the
profit in when the ith job is assigned to jth machine. How should the jobs be
assigned to the machines so as to maximize the total profit? Also find the machine
which will be left idle.

Machines
I II III IV V VI
A 7 20 56 9 17 25
B 41 76 70 48 61 46
Jobs C 39 26 89 35 43 39
D 72 40 25 47 37 30
E 34 9 55 20 23 16

Solution: Convert the problem to minimization type

I II III IV V VI
A 7 20 56 9 17 25
B 41 76 70 48 61 46
C 39 26 89 35 43 39
D 72 40 25 47 37 30
E 34 9 55 20 23 16
F 0 0 0 0 0 0

I II III IV V VI
A 82 69 33 80 72 64
B 48 13 19 41 28 43
C 50 63 0 54 46 50
D 17 49 64 42 52 59
E 55 80 34 69 66 73
F 89 89 89 89 89 89

or

I II III IV V VI
A 82 69 33 80 72 64
B 48 13 19 41 28 43
C 50 63 0 54 46 50
D 17 49 64 42 52 59
E 55 80 34 69 66 73

23
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

I II III IV V VI
A 82 69 33 80 72 64
B 48 13 19 41 28 43
C 50 63 0 54 46 50
D 17 49 64 42 52 59
E 55 80 34 69 66 73
F 0 0 0 0 0 0

I II III IV V VI
A 49 36 [0] 47 39 31
B 35 [0] 6 28 15 30
C 50 63 0 54 46 50
D [0] 32 47 25 35 42
E 21 46 0 35 32 39
F 0 0 0 [0] 0 0

I II III IV V VI
A 49 36 [0] 32 24 16
B 35 [0] 6 13 0 15
C 50 63 0 39 31 35
D [0] 32 47 10 20 27
E 21 46 0 20 17 24
F 15 15 15 [0] 0 0

I II III IV V VI
A 49 26 [0] 22 14 6
B 45 [0] 16 13 0 15
C 50 53 0 29 21 25
D [0] 22 47 0 10 17
E 21 36 0 10 7 14
F 25 15 25 [0] 0 0

I II III IV V VI
A 43 20 0 16 8 [0]

24
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

B 45 [0] 22 13 0 15
C 44 47 [0] 23 15 19
D [0] 22 53 0 10 17
E 15 30 0 4 1 8
F 25 15 31 [0] 0 0

I II III IV V VI
A 43 20 1 16 8 [0]
B 45 [0] 23 13 0 15
C 43 46 [0] 22 14 18
D [0] 22 54 0 10 17
E 14 29 0 3 [0] 7
F 25 15 32 [0] 0 0

A – VI, B – II, C – III, D – I, E – V

Total profit = 25 + 76 + 89 + 72 + 23 = 285, Machine IV left idle

18) A company has 5 jobs to be processed on 5 machines. The following table gives the
profit in when the ith job is assigned to jth machine. How should the jobs be
assigned to the machines so as to maximize the total profit?

Machines
I II III IV V
A 7 20 56 9 17
B 41 76 70 48 61
Jobs C 39 26 89 35 43
D 72 40 25 47 37
E 34 9 55 20 23

Solution: Convert the problem to minimization type

I II III IV V
A 82 69 33 80 72
B 48 13 19 41 28
C 50 63 0 54 46
D 17 49 64 42 52
E 55 80 34 69 66

I II III IV V

25
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

A 49 36 0 47 39
B 35 0 6 28 15
C 50 63 0 54 46
D 0 32 47 25 35
E 21 46 0 35 32

I II III IV V
A 49 36 [0] 22 24
B 35 [0] 6 3 0
C 50 63 0 29 31
D [0] 32 47 0 20
E 21 46 0 10 17

I II III IV V
A 39 26 [0] 12 14
B 35 [0] 16 3 0
C 40 53 0 19 21
D [0] 32 57 0 20
E 11 36 0 [0] 7

I II III IV V
A 32 19 [0] 12 7
B 35 [0] 23 10 0
C 33 46 0 19 14
D [0] 32 64 7 20
E 4 29 0 [0] 0

I II III IV V
A 32 12 0 5 [0]
B 42 [0] 30 10 0
C 33 39 [0] 12 7
D [0] 25 64 0 13
E 11 29 0 [0] 0

A – V, B – II, C – III, D – I, E – IV, Total profit = 17 + 76 + 89 + 72 + 20 = 274

26
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

19) One car is available at each of the stations 1, 2, 3, 4, 5 and 6 and one car is required at
each of the stations at 7, 8, 9, 10, 11 and 12. The distances between the various
stations are given below. How should the cars be dispatched so as to minimize the
total mileage travelled?

7 8 9 10 11 12
1 41 72 39 52 25 51
2 22 29 49 65 81 50
3 27 39 60 61 32 32
4 45 50 48 52 37 43
5 29 40 39 26 30 33
6 82 40 40 60 51 30

Solution:

7 8 9 10 11 12
1 16 47 14 27 0 26
2 0 7 27 43 59 28
3 0 12 33 34 5 5
4 8 13 11 15 0 6
5 3 14 13 0 4 7
6 52 10 10 30 21 0

7 8 9 10 11 12
1 16 40 4 27 [0] 26
2 0 [0] 17 43 59 28
3 [0] 5 23 34 5 5
4 8 6 1 15 0 6
5 3 7 3 [0] 4 7
6 52 3 [0] 30 21 0

7 8 9 10 11 12
1 16 39 3 27 [0] 25
2 1 [0] 17 44 60 28
3 [0] 4 22 34 5 4
4 8 5 [0] 15 0 5
5 3 6 2 [0] 4 6
6 53 3 0 31 22 [0]

27
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

1 – 11, 2 – 8, 3 – 7, 4 - 9, 5 – 10, 6 – 12
Mileage travelled = 25 + 29 + 27 + 48 + 26 + 30 = 185

20) Five trucks are available at five stations A, B, C, D and E. These are required at five
stations 1, 2, 3, 4 and 5. The mileage between the various stations is given below.
How should the trucks be transported so as to minimize the total mileage covered?

1 2 3 4 5
A 10 5 9 18 11
B 13 19 6 12 14
C 3 2 4 4 5
D 18 9 12 17 15
E 11 6 14 19 10

Solution:

1 2 3 4 5
A 5 0 4 13 6
B 7 13 0 6 8
C 1 0 2 2 3
D 9 0 3 8 6
E 5 0 8 13 4

1 2 3 4 5
A 4 [0] 4 11 3
B 6 13 [0] 4 5
C [0] 0 2 0 0
D 8 0 3 6 3
E 4 0 8 11 1

1 2 3 4 5
A 3 [0] 4 10 2
B 5 13 [0] 3 4
C [0] 1 3 0 0
D 7 0 3 5 2
E 3 0 8 10 [0]

28
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

1 2 3 4 5
A [0] 0 4 7 2
B 2 13 [0] 0 4
C 0 4 6 [0] 3
D 4 [0] 3 2 2
E 0 0 8 7 [0]

A – 1, B – 3, C – 4, D – 2, E – 5, Mileage covered = 39 miles.

21) A workshop has got five mechanics A, B, C, D and E. The workshop needs five
vehicles to be repaired. The time taken by five mechanics to repair five vehicles is as
follows. Assign the mechanics to the different vehicles in such a way that the total
repair time has to be minimum.

A B C D E
1 3 9 6 9 18
2 6 12 9 3 15
3 15 18 9 12 18
4 9 3 12 6 6
5 3 15 18 15 12

Solution:

A B C D E
1 0 6 3 6 15
2 3 9 6 0 12
3 6 9 0 3 9
4 6 0 9 3 3
5 0 12 15 12 9

A B C D E
1 [0] 6 3 6 12
2 3 9 6 [0] 9
3 6 9 [0] 3 6
4 6 [0] 9 3 0
5 0 12 15 12 6

A B C D E
1 [0] 0 3 6 6

29
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

2 3 3 6 [0] 3
3 6 3 [0] 3 0
4 12 [0] 15 9 0
5 0 6 15 12 [0]

or

A B C D E
1 0 [0] 3 6 6
2 3 3 6 [0] 3
3 6 3 [0] 3 0
4 12 0 15 9 [0]
5 [0] 6 15 12 0

1 – A or B, 2 – D, 3 – C, 4 – B or E, 5 – A or E
Minimum repair time = 3 + 3 + 9 + 3 + 12 = 30

22) The layout of a plant is being modified. Four machines M 1, M2, M3 and M4 are to be
installed in the machine shop. There are five vacant places A, B, C, D and E available.
Because of space constraints machine M2 cannot be located at C while M3 cannot be
placed at A. Find the optimum assignment schedule which space is less vacant after
the assignment.

A B C D E
M1 9 11 15 10 11
M2 12 9 -- 10 9
M3 -- 11 14 11 7
M4 14 8 12 7 8

Solution:

A B C D E
M1 9 11 15 10 11
M2 12 9 ∞ 10 9
M3 ∞ 11 14 11 7
M4 14 8 12 7 8
M5 0 0 0 0 0

A B C D E
M1 [0] 2 6 1 2
M2 3 [0] ∞ 1 0
M3 ∞ 4 7 4 [0]

30
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

M4 7 1 5 [0] 1
M5 0 0 [0] 0 0

M1 – A, M2 – B, M3 – E, M4 – D, 9 + 9 + 7 + 7 = 32, Space C is less vacant

23) A company has purchased 4 new machines of different types. There are four locations
available in the shop where a machine could be installed. Some of these locations are
more desirable than others because of their proxirnities to work Centers that would
have a heavy work floor to and from these machines. The estimated cost per unit time
of material handling involving each machine is given below.

Location
1 2 3 4
A 4 6 10 5
B 7 4 -- 5
Machines C -- 6 9 6
D 9 3 7 2

Solution:

1 2 3 4
A 4 6 10 5
B 7 4 ∞ 5
C ∞ 6 9 6
D 9 3 7 2

1 2 3 4
A 0 2 6 1
B 3 0 ∞ 1
C ∞ 0 3 0
D 7 1 5 0

1 2 3 4
A [0] 2 3 1
B 3 [0] ∞ 1
C ∞ 0 [0] 0
D 7 1 2 [0]

31
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

24) Consider the problem of assigning four operators to four machines. The assignment
cost in are given below. Find the optimal assignment.

Machine
1 2 3 4
1 5 5 -- 2
2 7 4 2 3
Operator 3 9 3 5 --
4 7 2 6 7

Suppose a fifth machine is made available in the above problem with respective
assignment costs (in ) to the four operators as 2, 1, 2 and 8. Is it worth utilizing the
fifth machine? If so why and which machine must be replaced?
Solution:
(i)

A B C D
1 5 5 ∞ 2
2 7 4 2 3
3 9 3 5 ∞
4 7 2 6 7

A B C D
1 3 3 ∞ 0
2 5 2 0 1
3 6 0 2 ∞
4 5 0 4 5

A B C D
1 [0] 3 ∞ 0
2 2 2 [0] 1
3 3 [0] 2 ∞
4 2 0 4 5

A B C D
1 [0] 4 ∞ 0
2 1 2 [0] 0

32
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

3 2 [0] 2 ∞
4 1 0 4 4

A B C D
1 0 5 ∞ [0]
2 1 3 [0] 0
3 1 [0] 1 ∞
4 [0] 0 3 3

1 – D, 2 – C, 3 – B, 4 – A, Cost = 2 + 2 + 3 + 7 = 14

(ii)

A B C D E
1 5 5 ∞ 2 2
2 7 4 2 3 1
3 9 3 5 ∞ 2
4 7 2 6 7 8
5 0 0 0 0 0

A B C D E
1 3 3 ∞ [0] 0
2 6 3 1 2 [0]
3 7 1 3 ∞ 0
4 5 [0] 4 5 6
5 [0] 0 0 0 0

A B C D E
1 3 4 ∞ [0] 1
2 5 3 [0] 1 0
3 6 1 2 ∞ [0]
4 4 [0] 3 4 6
5 [0] 1 0 0 1

1 – D, 2 – C, 3 – E, 4 – B, Cost = 2 + 2 + 2 + 2 = 8, Replace machine 1

25) Four different jobs can be done on four different machines. The setup and take down
time costs are assumed to be prohibitively high for change overs. The matrix below gives the cost in

33
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research
Rs. of producing job I on machines. How should the jobs be assigned to the various machines so that
the total cost minimized?

Machines
1 2 3 4
1 5 7 11 6
2 8 5 9 6
Jobs 3 4 7 10 7
4 10 4 8 3

Solution:

Machines
1 2 3 4
1 0 2 6 1
2 3 0 4 1
Jobs 3 0 3 6 3
4 7 1 5 0

Machines
1 2 3 4
1 [0] 2 2 1
2 3 [0] 0 1
Jobs 3 0 3 2 3
4 7 1 1 [0]

Machines
1 2 3 4
1 [0] 1 1 1
2 4 [0] 0 2
Jobs 3 0 2 1 3
4 7 0 0 [0]

Machines
1 2 3 4
1 [0] 0 0 0
2 5 [0] 0 2
Jobs 3 0 1 [0] 2
4 8 0 0 [0]

1 – 1, 2 – 2, 3 – 3, 4 – 4, 5 + 5 + 10 + 3 = 23

34
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

26) A company has 4 territories open and 4 salesman available for assignment. The
territories are not equally rich in sales potential. It is estimated that a typical salesman
operating in each territory would bring the following annual sales.

Territory I II III IV
Annual sales ( ) 60000 50000 40000 30000

It is estimated that looking under the same condition, salesman yearly sales would be
proportionately as follows:

Salesman A B C D
Proportion 7 5 5 4

Assign the best salesman to the richest territory so as to maximize the total expected
sales. Also indicate the total expected sales.
Solution:
Total sales proportion = 7 + 5 + 5 + 4 = 21
Sales proportion of salesman’s in different territories

I II III IV
A

Consider as one unit

I II III IV
A 42 35 28 21
B 30 25 20 15
C 30 25 20 15
D 24 20 16 12

Convert the problem to minimization type

I II III IV
A 0 7 14 21

35
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

B 12 17 22 27
C 12 17 22 27
D 18 22 26 30

I II III IV
A 0 7 14 21
B 0 5 10 15
C 0 5 10 15
D 0 4 8 12

I II III IV
A [0] 3 6 9
B 0 1 2 3
C 0 1 2 3
D 0 [0] 0 0

I II III IV
A [0] 2 5 8
B 0 [0] 1 2
C 0 0 1 2
D 1 0 [0] 0

I II III IV
A [0] 2 4 7
B 0 [0] 0 1
C 0 0 [0] 1
D 2 1 0 [0]

or

I II III IV
A [0] 2 4 7
B 0 0 [0] 1
C 0 [0] 0 1
D 2 1 0 [0]

A – I, B – II, C – III, D – IV or A – I, B – III, C – II, D – IV

36
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

Maximum sales = 42 + 25 + 20 + 12 = 99 = 47142.86

27) An air freight company picks up and delivers freight where customers require.
Company has two types of aircrafts X and Y with equal loading capacities but
different operating costs. These are as shown below.

Type of Cost per km in

Aircraft
Empty Loaded
X 1.00 2.00
Y 1.50 3.00

The present four locations of the aircrafts which the company is having are as shown
below:

J → X, K → Y, L → Y, M → X

Four customers of the company located at A, B. C, D wants to transport nearly the

same size of load .to their final destination. The final destinations are at distances of
600, 300, 1000 and 500 km from loading points A, B, C and D respectively. Distance
in km between location of aircraft and loading points are as follows.

A B C D
J 300 200 400 100
K 300 100 300 300
L 400 100 100 500
M 200 200 400 200

Determine the optimum allocation

Solution:

A B C D
J 1×300+2×600 1×200+2×300 1×400+2×1000 1×100+2×500
K 1.5×300+3×600 1.5×100+3×300 1.5×300+3×1000 1.5×300+3×500
L 1.5×400+3×600 1.5×100+3×300 1.5×100+3×1000 1.5×500+3×500
M 1×200+2×600 1×200+2×300 1×400+2×1000 1×200+2×500

A B C D
J 1500 800 2400 1100
K 2250 1050 3450 1950

37
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

L 2400 1050 3150 2250

M 1400 800 2400 1200

A B C D
J 700 0 1600 300
K 1200 0 2400 900
L 1350 0 2100 1200
M 600 0 1600 400

A B C D
J 100 0 [0] 0
K 600 [0] 800 600
L 750 0 500 900
M [0] 0 0 100

A B C D
J 100 500 0 [0]
K 100 [0] 300 100
L 250 0 [0] 400
M [0] 500 0 100

J – D, K – B, L – C, M – A, Cost =1100 + 1050 + 3150 + 1400 = 6700

28) An airline operates 7 days a week has the time-table shown below. Crew must have a
minimum layover time of 5 hours between the flights. Obtain the pairing of flights
that minimizes the layover time away from home. Crew will be placed at the city that
results in minimum layover time. For each pair mention the town where the crew
should be based.

Delhi – Jaipur Jaipur - Delhi

Flight Departure Arrival Flight Departure Arrival
No. No.
1 7 AM 8 AM 101 8 AM 9.15 AM
2 8 AM 9 AM 102 8.30 AM 9.45 AM
3 1.30 PM 2.30 PM 103 12 Noon 1.15 PM
4 6.30 PM 7.30 PM 104 5.30 PM 6.45 PM

Solution:

38
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

Crew based at Delhi

101 102 103 104
1 24 24.5 28 9.5
2 23 23.5 27 8.5
3 17.5 18 21.5 27
4 12.5 13 16.5 22

Crew based at Jaipur*

101 102 103 104
1 21.75 21.25 17.75 12.25
2 22.75 22.25 18.75 13.25
3 28.25 27.75 24.25 18.75
4 9.25 8.75 5.25 23.75

* Indicates crew based at Jaipur

101 102 103 104

1 21.75* 21.25* 17.75* 9.5
2 22.75* 22.25* 18.75* 8.5
3 17.5 18 21.5 18.75*
4 9.25* 8.75* 5.25* 22

101 102 103 104

1 87 85 71 38
2 91 89 75 34
3 70 72 86 75
4 37 35 21 88

101 102 103 104

1 49 47 33 0
2 57 55 41 0
3 0 2 16 5
4 16 14 0 67

101 102 103 104

1 49 45 33 [0]

39
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

2 57 53 41 0
3 [0] 0 16 5
4 16 12 [0] 67

101 102 103 104

1 37 33 33 [0]
2 45 41 41 0
3 [0] 0 28 17
4 4 [0] 0 67

101 102 103 104

1 4 [0] 0 0
2 12 8 8 [0]
3 [0] 0 28 50
4 4 0 [0] 100

or

101 102 103 104

1 4 0 [0] 0
2 12 8 8 [0]
3 [0] 0 28 50
4 4 [0] 0 100

1 – 102 or 103, 2 – 104, 3 – 101, 4 - 103 or 102

29) An airline operates 7 days a week has the time-table shown below. Crew must have a
minimum layover time of 1 hour between the flights. Obtain the pairing of flights that
minimizes the layover time away from home. Crew will be placed at the city that
results in minimum layover time. For each pair mention the town where the crew
should be based.

Delhi - Srinagar Srinagar - Delhi

Flight Departure Arrival Flight Departure Arrival
No. No.
1 7.30 AM 9 AM 101 7 AM 10 AM
2 8.45 AM 9.45 AM 102 7.45 AM 10.45 AM
3 2 PM 3.30 PM 103 11 AM 2 PM
4 5.45 PM 7.15PM 104 6 PM 9 PM
5 7 PM 8.30 PM 105 7.30 PM 10.30 PM

40
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

Solution:

Crew based at Delhi

101 102 103 104 105
1 22 22.75 2 9 10.5
2 21.25 22 1.25 8.25 9.75
3 15.5 16.25 19.5 2.5 4
4 11.75 12.5 15.75 22.75 24.25
5 10.5 11.25 14.5 21.5 23

Crew based at Srinagar*

101 102 103 104 105
1 21.5 20.75 17.5 10.5 9
2 22.75 22 18.75 11.75 10.25
3 4 3.25 24 17 15.5
4 7.75 7 3.75 20.75 19.25
5 9 8.25 5 22 20.5

* Indicates crew based at Srinagar

101 102 103 104 105

1 21.5* 20.75* 2 9 9*
2 21.25 22 1.25 8.25 9.75
3 4* 3.25* 19.5 2.5 4
4 7.75* 7* 3.75* 20.75* 19.25*
5 9* 8.25* 5* 21.5 20.5*

101 102 103 104 105

1 86 83 8 36 36
2 85 88 5 33 39
3 16 13 78 10 16
4 31 28 15 83 77
5 36 33 20 86 82

101 102 103 104 105

1 78 75 0 28 28
2 80 83 0 28 34
3 6 3 68 0 6

41
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

4 16 13 0 68 62
5 16 13 0 66 62

101 102 103 104 105

1 72 72 [0] 28 22
2 74 80 0 28 28
3 [0] 0 68 0 0
4 10 10 0 68 56
5 10 10 0 66 56

101 102 103 104 105

1 62 62 [0] 18 12
2 64 70 0 18 18
3 0 0 78 [0] 0
4 [0] 0 0 58 46
5 0 [0] 0 56 46

or

101 102 103 104 105

1 62 62 [0] 18 12
2 64 70 0 18 18
3 0 0 78 [0] 0
4 0 [0] 0 58 46
5 [0] 0 0 56 46

101 102 103 104 105

1 62 62 0 6 0
2 64 70 [0] 6 6
3 12 12 90 0 0
4 12 12 12 58 46
5 0 0 0 44 34

101 102 103 104 105

1 62 62 0 6 [0]
2 64 70 [0] 6 6

42
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

3 12 12 90 [0] 0
4 [0] 0 0 46 34
5 0 [0] 0 44 34

or

101 102 103 104 105

1 62 62 0 6 [0]
2 64 70 [0] 6 6
3 12 12 90 [0] 0
4 0 [0] 0 46 34
5 [0] 0 0 44 34

1 – 105, 2 – 103, 3 – 104, 4 – 101, 5 – 102

30) A trip from Bangalore to Chennai takes six hours by bus. The time table of bus
services in both directions is given below:

Bangalore – Chennai Chennai - Bangalore

Route No. Departure Arrival Route No. Departure Arrival
A 6.00 AM 12.00 Noon 1 5.30 AM 11.30 AM
B 7.30 AM 1.30 PM 2 9.00 AM 3.00 PM
C 11.30 AM 5.30 PM 3 3.00 PM 9.00 PM
D 7.00 PM 1.00 AM 4 6.30 PM 0.30 AM
E 0.30 AM 6.30 AM 5 12.00 Midnight 6.00 AM

The cost of providing this service by the transport company depends upon the time
spent by the bus crew (driver and conductor) away from their places in addition to
service times. There are five crews, every crew should be provided with 4 hours of
rest before return trip and should not wait for more than 24 hours for the return trip.
The company has residential facilities for the crew at Bangalore and Chennai. Obtain
pairing of routes so as to minimize the waiting time.
Solution:

Crew based at Bangalore

1 2 3 4 5
A 17.5 21 27 6.5 12
B 16 19.5 25.5 5 10.5
C 12 15.5 21.5 25 6.5
D 4.5 8 14 17.5 23
E 23 26.5 8.5 12 17.5

43
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

Crew based at Chennai*

1 2 3 4 5
A 18.5 15 9 5.5 24
B 20 16.5 10.5 7 25.5
C 24 20.5 14.5 11 5.5
D 7.5 28 22 18.5 13
E 13 9.5 27.5 24 18.5

* Indicates crew based at Chennai

1 2 3 4 5
A 17.5 15* 9* 5.5* 12
B 16 16.5* 10.5* 5 10.5
C 12 15.5 14.5* 11* 5.5*
D 4.5 8 14 17.5 13*
E 13* 9.5* 8.5 12 17.5

1 2 3 4 5
A 35 30 18 11 24
B 32 33 21 10 21
C 24 31 29 22 11
D 9 16 28 35 26
E 26 19 17 24 35

1 2 3 4 5
A 24 19 7 0 13
B 22 23 11 0 11
C 13 20 18 11 0
D 0 7 19 26 17
E 9 2 0 7 18

1 2 3 4 5
A 24 17 7 [0] 13
B 22 21 11 0 11
C 13 18 18 11 [0]
D [0] 5 19 26 17
E 9 [0] 0 7 18

44
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

1 2 3 4 5
A 24 12 2 [0] 13
B 22 16 6 0 11
C 13 13 13 11 [0]
D [0] 0 14 26 17
E 14 [0] 0 12 23

1 2 3 4 5
A 22 10 [0] 0 13
B 20 14 4 [0] 11
C 11 11 11 11 [0]
D [0] 0 14 28 19
E 14 [0] 0 14 25

Route Waiting Crew

Number Time Residence
A3 9 Chennai
B4 5 Bangalore
C5 5.5 Chennai
D1 4.5 Bangalore
E2 9.5 Chennai

Total waiting time = 33 hours 30 minutes

Questions

1) What is an assignment problem? Give two areas of its application.

2) What is an assignment problem? Explain with examples.
3) What is the difference between transportation problem and assignment problem?
4) What is the main difference between transportation problem and assignment problem?
5) What are the differences between Transportation problem and Assignment problem?
6) What are the similarities and differences between transportation and assignment
problems?
7) Assignment problems are inherently degenerate, why?
8) The assignment problem is inherently degenerative, why?

45
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

9) Solution to an assignment problem is inherently degenerate. Explain

10) Solution to an assignment problem is inherently degenerate. Explain why?
11) How does an assignment problem differ from transportations problem?
12) How does an assignment problem differ from that of transportation problem?
13) State the mathematical model of assignment problem.
14) Enumerate the steps involved in Hungarian method of solving assignment technique.
15) List four differences between transportation and assignment models.
16) List out the differences between transportation and assignment problems
17) List the steps involved in Hungarian method.
18) Compare assignment problem with transportation problem.
19) Distinguish between Transportation problem and Assignment problem.
20) Distinguish between transportation and assignment models.
21) Distinguish clearly between assignment problem and transportation problem.
22) Differentiate between assignment and transportation problem.
23) Differentiate between assignment problem and transportation problem.
24) Differentiate between transportation and assignment models.
25) Differentiate between transportation and assignment problems.
26) Differentiate between transportation problem and assignment problem.
27) Differentiate c1early between transportation and assignment problems.
28) Discuss the similarity between transportation problem and assignment problem.
29) Explain the difference between transportation and an assignment problem.
30) Explain the differences between assignment problem and transport and problem.
31) Explain Hungarian assignment method.
32) Explain Hungarian method of solving an assignment problem.
33) Explain the steps involved in solving assignment problem using Hungarian method.
34) Explain the computational procedure for obtaining an optimum assignment.
35) Explain unbalanced assignment problem with an example.
36) Solution to an assignment problem is inherently degenerate. Explain.
37) The solutions to assignment problems are inherently degenerative. Explain.
38) Describe the Hungarian method of solving an assignment problem.
39) Formulate the general assignment problem as an LPP
40) With an example, explain the conversion of maximization type to minimization type
of assignment problem.
41) Write the procedure of Hungarian method for modeling assignment problems.
46
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

42) Write a note on assignment problem

43) Write an algorithm note on assignment problem
44) Write different steps in Hungarian algorithm to solve an assignment problem.

Exercises

1) Find an optimal solution to an assignment problem using Hungarian method

Operators
1 2 3 4 5
1 10 12 15 12 8
2 7 16 14 14 11
Jobs 3 13 14 7 9 9
4 12 10 11 13 10
5 8 13 15 11 15
2) Find an optimal solution to an assignment problem using Hungarian method. Time taken in minutes by
4 workers as follows:
Jobs
1 2 3 4
1 45 40 51 67
2 57 42 63 55
Workers 3 49 52 48 64
4 41 45 60 55
3) Find an optimal solution to an assignment problem using Hungarian method. The
figures shown in table indicate time in minutes.
Jobs
1 2 3 4
1 45 40 51 67
2 57 42 63 55
Workers 3 49 52 48 64
4 41 45 60 55
4) Find the optimal assignment plan and optimal cost for the following problem:
1 2 3 4 5 6
A 12 10 15 22 18 8
B 10 18 25 15 16 12
C 11 10 3 8 5 9
D 6 14 10 13 13 12
E 8 12 11 7 13 10
5) Find the minimum cost solution for the 5 x 5 assignment problem whose cost
coefficients are given below
B
1 2 3 4 5
1 -2 -4 -8 -6 -1
2 0 -9 -5 -5 -4
A 3 -3 -8 0 -2 -6

47
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

4 -4 -3 -1 0 -3
6) Find the optimal solution for the assignment problem with following cost matrix.
Machine
I II III IV V
A 11 17 8 16 20
B 9 7 12 6 15
Job C 13 16 15 12 16
D 21 24 17 28 26
E 14 10 12 11 15
Answer: A – I, B – IV, C – V, D – III, E – II, 60
7) Solve the following minimum assignment problem
I II III IV
1 2 3 4 5
2 4 5 6 7
3 7 8 9 8
4 3 5 8 4
8) Solve the following assignment problem
A B C D E
1 3 5 10 15 8
2 4 7 15 18 8
3 8 12 20 20 12
4 5 5 8 10 6
5 10 10 15 25 10
9) Solve the following minimal assignment problem
Man
1 2 3 4 5
A 12 8 7 15 14
B 7 9 17 14 10
Job C 9 6 12 6 7
D 7 6 14 6 10
E 9 6 12 10 6
10) Solve the following minimal assignment problem.
Machines
A B C D E
1 12 8 7 15 4
2 7 9 17 14 10
Jobs 3 9 6 12 6 7
4 7 6 14 6 10
5 9 6 12 10 6
11) Solve the following assignment problem (minimization problem)
a b c d e f
A 9 22 58 11 19 27

48
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

B 43 78 72 50 63 48
C 41 28 91 37 45 33
D 74 42 27 49 39 32
E 36 11 57 22 25 18
F 3 56 53 31 17 28
12) Solve the following assignment problem (minimization problem)
a b c d e
A 160 130 175 190 200
B 135 120 130 160 175
C 140 110 155 170 185
D 50 50 80 80 110
E 55 35 70 80 105
13) Solve the assignment problem to minimize the total cost.
I II III IV V
A 15 10 25 25 10
B 1 8 10 20 2
C 8 9 17 20 10
D 14 10 25 27 15
E 10 8 25 27 12
14) Solve the following assignment problem using Hungarian method. The matrix entries
are processing time in hours. Indicate alternate solution if any.
Operator
1 2 3 4 5
Job 1 3 9 2 3 7
2 6 1 5 6 6
3 9 4 7 10 3
4 2 5 4 2 1
5 9 6 2 4 5
15) Solve the following assignment problem and also indicate which job should be left idle.
Job
1 2 3 4 5
A 5 10 2 12 4
B 4 10 3 14 6
Machine C 6 13 4 16 6
D 7 14 4 18 9
E 8 14 6 18 12
F 12 18 10 20 12
Is the solution is unique, if not find the alternate solution.
16) Solve the following assignment problem. The assignment of job D to machine 1 and
job E to machine 4 is prohibited.
Machines

49
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

1 2 3 4 5 6
A 20 15 26 40 32 12
B 15 32 46 26 28 20
Jobs C 18 15 2 12 6 14
D -- 24 12 22 22 20
E 12 20 18 -- 22 15
17) Solve the following assignment problem
Machines
1 2 3 4 5 6
A 20 15 25 42 30 11
B 15 34 45 25 29 21
Jobs C 18 15 3 12 7 15
D -- 25 11 22 22 20
E 13 20 18 -- 21 15
18) Solve the following assignment problem.
Machine
1 2 3 4 5
1 5 5 -- 2 6
2 7 4 2 3 4
Operator 3 9 3 5 -- 3
4 7 2 6 7 2
5 6 5 7 9 1
19) Solve the following minimal assignment problem
A B C D E
1 24 16 14 30 8
2 14 18 34 28 20
3 18 12 24 12 14
4 14 12 28 12 20
5 18 12 24 20 12
20) Solve the assignment problem and obtain the optimum assignment of operators to
machines. Matrix entries show production time/component.
Operators
O1 O2 O3 O4
M1 18 26 17 11
M2 13 28 14 26
Machines M3 38 19 18 15
M4 19 26 24 10
21) Time taken in minutes 4 workers is given below. Find an optimal solution to an assignment
problem
Jobs
A B C D

50
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

1 45 40 51 67
2 57 42 63 55
Workers 3 49 52 48 64
4 41 45 60 55
22) There are 5 jobs to be assigned, one each to five machines and the associated cost matrix is
given below. Find the optimum assignment of jobs and the minimum total cost to process all
the jobs.
Machine
J K L M N
A 11 17 8 16 20
B 9 7 12 6 15
Job C 13 16 15 12 16
D 21 24 17 28 26
E 14 10 12 11 16
23) A company has 5 jobs to be done. The following matrix shows the return in of
assigning machines A, B, C, D, and E to the jobs 1, 2, 3, 4, and 5. Assign the five
machines so as to maximize the total return.
1 2 3 4 5
A 5 11 10 12 4
B 2 4 6 3 5
C 3 12 5 14 6
D 6 14 4 11 7
E 7 9 8 12 5
24) A firm plans to begin production of 4 new products on its 4 plants. The unit cost of
producing i at plant j is given below. Find the assignment that minimizes the total
cost of production per unit.
Plants
1 2 3 4
A 15 11 13 15
B 17 12 12 13
Products C 14 15 10 14
D 16 13 11 17
25) A firm produces four products A, B, C and D. There are four operators (I, II, III and
IV), who-are capable of producing any of these products. The processing time varies
from operator to operator. The firm records 8 hours of working per day and allows 30
minutes for lunch. The products A, B, C and D give a profit of 8, 6, 5 and 4
per product respectively. The processing time for each product is given below. Find
the optimum distribution schedule to maximize profit.
Products (Processing

51
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

time in minutes)
A B C D
I 15 9 10 6
II 10 6 9 6
Operators III 25 15 15 9
IV 15 9 10 10
26) A batch of four jobs can be assigned to five different machines. The following table
gives the setup time for each job on various machines
Machines
1 2 3 4 5
A 10 11 4 2 8
B 7 11 10 14 12
Jobs C 5 6 9 12 14
D 13 15 11 10 7
Find the optimal assignment of jobs to machines, which will minimize the total setup time.
27) Given the cost matrix assign the job I, II, III and IV to men A, B, C and D such that
the jobs are completed at minimum cost. X indicates impossible assignment
Jobs
I II III IV
A 30 X 26 28
B X 32 24 20
Men C 20 22 X 27
D 23 20 21 19
28) Five machines are to be assigned to five jobs with the following cost of assignment.
Determine the optimum assignment of machines to jobs.
Jobs
J1 J2 J3 J4 J5
M1 11 17 8 16 20
M2 9 7 12 6 15
Machines M3 13 16 15 12 16
M4 21 24 17 28 26
M5 14 10 12 11 15
Also find the minimum cost of assignment
29) An airline company has drawn up a new flight schedule involving five flights. To
assist in allocating five pilots to the flights, it has asked them to state their preference
scores by giving each flight a number out of 10. The higher the number, the greater is
the preference. Certain of these flights arc unsuitable to some pilots owing to
domestic reasons. These have been marked with a “x”. What should be the allocation
in order to meet as many preferences as possible?

52
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

Flight number
1 2 3 4 5
1 8 2 x 5 4
2 10 9 2 8 4
Pilots 3 5 4 9 6 x
4 3 6 2 8 7
5 5 6 10 4 3
30) A University examination panel has five examiners. The examiners are to be assigned
to two practical examinations and two each for each practical exam, University
desires to assign examiners such that the total distance travelled by all the examiners
is minimum. The distance each examiner would have to travel to each practical
examination centre are given below. Solve the problem.
Examiner
E1 E2 E3 E4 E5
Practical A 20 40 60 20 70
B 45 90 70 60 15
31) The owner of a small machine shop has four machinists available to do jobs for the
day. Five jobs are offered with expected profit for each machinist on each jobs as
follows:
1 2 3 4
A 32 41 57 18
B 48 54 62 34
C 20 31 81 57
D 71 43 41 47
E 52 29 51 50
Find by using assignment method, the assignment of machinist to jobs that will result
in a maximum profit.
32) The owner of a small machine shop has four machinists to assign the jobs for the day.
Five jobs are offered with expected profit for each machinist on each job as given
below. Find by using assignment method, the assignment of jobs that will result in
maximum profit. Which job should be declined?
A B C D E
1 62 78 50 101 82
2 71 84 61 73 59
3 87 92 111 71 81
4 48 64 87 77 80
33) A private firm employs typists on hourly piece rate basis for their daily work. Five
typists are working in that firm and their charges and speeds are different. On the
basis of some earlier understanding only one job is to be given to one typist and the

53
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

typist is paid for full hours even when he/she works for a fraction of an hour. Find
least cost assignment.
Typist Rate/hour Number of Job Number
pages/hour of pages
A 5 12 P 199
B 6 14 Q 175
C 3 8 R 145
D 4 10 S 295
E 4 11 T 178
34) A team of five horses and five riders has entered a jumping show contest. The number
of penalty points to be expected when each rider rides any horse is shown below:
Rider
R1 R2 R3 R4 R5
H1 5 3 4 7 1
H2 2 3 7 6 5
Horses H3 4 1 5 2 4
H4 6 8 1 2 3
H5 4 2 5 7 1
How should the horses be allotted to the riders so as to minimize the expected loss of
the team?
35) Four operators are to be assigned to four machines. The assignment cost in is given
below.
Machine
1 2 3 4
1 5 5 -- 2
2 7 4 2 3
Operator 3 9 3 5 --
4 7 2 6 7
Find the optimal assignment. Suppose a fifth machine is made available. Its
assignment costs to the four operators in are 2, 1, 2 and 8 respectively. Reformulate
the problem as an assignment model and find the optimal solution. Is it economical to
replace one of the existing machines? If so which one?
36) Four operators are to be assigned to four machines. The assignment cost in is given
below:
Machine
A B C D
1 5 5 -- 2
2 7 4 2 3
Operator 3 9 3 5 --
4 7 2 6 7

54
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

Operator 1 to C and 3 to D cannot be assigned. Find the optimal assignment.

Suppose a fifth machine is made available. Its assignment costs to the four operators
in are 2, 1, 2 and 8 respectively. Reformulate the problem as an assignment model
and find the optimal solution. Is it economical to replace one of the existing
machines? If so, which one?
37) Four workers are available to work with 4 machines. The cost associated with each
worker machine assignment is given below. A fifth machine is available to replace
one of the existing machine and its associated costs are given below:
Machine
1 2 3 4 5
A 5 5 -- 2 2
B 7 4 2 3 1
Workers C 9 3 5 -- 2
D 7 2 6 7 8
Determine whether the new machine can be accepted.
38) Four workers are available to work on 4 machines and the respective cost associated
with each machine - worker assignment is given below.
Machine
M1 M2 M3 M4
W1 12 3 6 --
W2 4 10 -- 5
Workers W3 7 2 8 9
W4 -- 7 8 6
The sign (--) indicates that the particular worker machine assignment is not permitted.
(i) Determine the optimum assignment.
(ii) A fifth machine is available to replace one of the existing machine and the
associated costs are W1 = 4, W2 = 3, W3 = 3 and W4 = 2. Determine
whether the new machine can be accepted and if so, which machine does it
replace?
39) Five jobs are to be processed and five machines are available, any machine can
process any job with the resulting profit in as follows.
Machines
A B C D E
1 32 38 40 28 40
2 40 24 28 21 26
Jobs 3 41 27 33 30 37
4 22 38 41 36 36
5 29 33 40 35 39

55
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

What is the maximum profit that may be expected if an optimum assignment is made?
Answer: 191
40) A marketing manager has four sales men and four sales districts. Considering the
capacities of the sales man and the nature of the districts, the marketing manager
estimates that sales per month (hundred ) each sales man in each district would be
as follows:
District
A B C D
1 32 38 40 28
Sales man 2 40 24 28 21
3 41 27 33 30
4 22 38 41 36
Find the assignment of sales man to districts that will result in maximum sales.
41) Five jobs are to be processed and five machines are available, any machine can
process any job with the resulting profit in as follows.
Machines
A B C D E
1 32 38 40 28 40
2 40 24 28 21 36
Jobs 3 41 27 33 30 37
4 22 38 41 36 36
5 29 33 40 35 39
What is the maximum profit that may be expected if an optimum assignment is made?
42) Four workers are available to work with 4 machines. The cost associated with each
worker-machine assignment is given below. A fifth machine is available to replace
one of the existing machine and the associated cost are also given below:
1 2 3 4 5
A 5 5 -- 2 2
B 7 4 2 3 1
C 9 3 5 -- 2
D 7 2 6 7 8
Determine whether the new machine can be accepted.
43) A company has four machines of which 3 jobs are to be done. Each job can be
assigned to one and only one machine. The cost of each Job on each machine is given
in the following table. Find the optimal assignment.
W X Y Z
A 18 24 28 32
B 8 13 17 19

56
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

C 10 15 19 22
44) A company has 6 jobs to be processed on 6 machines. The following table gives the
return in when the ith job is assigned to j th machine. How should the jobs be
assigned to the machines so as to maximize the overall return?
Machines
I II III IV V VI
A 7 20 56 9 17 25
B 41 76 70 48 61 46
Jobs C 39 26 89 35 43 31
D 72 40 25 47 37 30
E 34 9 55 20 23 16
F 10 54 51 29 15 26
45) A company has 5 jobs to be processed on 5 machines. The following table gives the
return in when the ith job is assigned to j th machine. How the jobs should be
assigned to the machines so as to maximize the total returns.
Machines
1 2 3 4 5
1 20 56 9 17 25
2 76 70 48 61 46
Jobs 3 26 89 35 43 31
4 40 25 47 37 30
5 9 55 20 23 16
46) Five workers are available to work, with the machines and the respective cost (in )
associated with each worker; machine assignment is given below. A Sixth machine is
available to replace one of the existing machines and the associated costs are also
given below.
Machines
M1 M2 M3 M4 M5 M6
W1 12 3 6 -- 5 9
W2 4 11 -- 5 -- 3
Workers W3 8 2 10 9 7 5
W4 -- 7 8 6 12 10
W5 5 8 9 4 6 --
(i) Determine whether the new machine can be accepted.
(ii) Determine also optimal assignments and associated savings in cost.
(iii) Solve the assignment problem and obtain the optimum assignment of
operators to machines. Matrix entries show production time/piece.
Operators
O1 O2 O3 O4 O5

57
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

M1 6 4 3 5 6
M2 2 1 4 3 4
Machines M3 4 3 2 8 6
M4 5 3 5 3 4
M5 1 4 6 2 1
47) A company has four machines on which three jobs are to be performed. Each job can
be assigned to one and only one machine. The profit of each job on each machine is
given in the table below:
Machines
W X Y Z
A 18 24 28 32
Jobs B 8 13 17 18
C 10 15 19 22
What are the job assignments that will maximize the profits?
48) A bank operations manager has five tellers (T) whom he must assign to customer
services of checking accounts (C), Foreign exchange (F), Notes (N) and savings (S)
accounts. Three tellers are not yet qualified for foreign exchange and one teller cannot
handle notes. Work sampling studies have shown that, working under constant
queues, the tellers can handle the number of customers per hour as given below.
Customers served per hour
Checking Foreign Notes Saving
T1 60 -- 30 50
T2 70 60 40 50
T3 30 -- 10 30
T4 40 -- -- 60
T5 40 70 50 80
Assuming the manager wishes to serve as many customers as possible what
assignment should be made? The extra teller will be assigned a data processing task.
Calculate the total number of customers served per hour. Use Hungarian method.
49) A marketing manager has 5 salesman and 5 sales districts considering the capacities
of the salesman and the nature of districts, the marketing manager estimates the sales
per month (in hundred ) each salesman in each district would be as follows.
A B C D E
1 24 16 14 30 8
2 14 18 34 28 20
3 18 12 24 12 14
4 14 12 28 12 20
5 18 12 24 20 12
Find the assignment of salesman to district that will result in maximum sales.

58
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

Answer: 1-B, 2-A, 3-E, 4-C, and 5-D, Maximum profit = 191
50) A manager has the problem of assigning four new methods to three production
facilities. The assignment of the new methods will increase profits by the amounts
shown. If only one method can be assigned to a production facility, determine the
optimal assignment so as to maximize the profit.
Profit in at production facilities
Method 1 2 3
A 12 9 13.5
B 10 11 12.5
C 11.5 10 10
D 13 12 10.5
51) A manager has to assign four jobs to three production facilities. The assignment of
jobs will increase profits by the amounts shown. If only one job can be assigned to a
production facility, determine the optimal assignment so as to maximize the profit.
Profit in at production facilities
Jobs 1 2 3
A 1200 900 1350
B 1000 1100 1250
C 1150 1000 1000
D 1300 1200 1050
52) A job shop has three employees who have varying proficiencies in their skills. The
table shows the manager’s assessment of the wage cost for each employee for three
jobs. Determine the optimal assignment.
Employee
Jobs E1 E2 E3
J1 100 124 140
J2 60 80 96
J3 88 76 68

53) Four software jobs are to be assigned to four computers. Processing cost are as
follows:
Computers
A B C D
1 65 100 65 60
2 68 27 29 27
Jobs 3 75 80 60 41
4 102 40 77 60
Find the optimal assignment.
54) A departmental head has five subordinates and five tasks to be performed. The
subordinates differ in effectiveness and the tasks differ in their intrinsic difficulty. The

59
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

time each man would take to perform each task and hence the effectiveness is given in
the matrix below. How the tasks should be allocated one to a man so as to minimize
the total man hours.
Subordinates
1 2 3 4 5
A 9 3 4 2 10
B 12 10 8 11 9
Task C 11 2 9 0 8
D 8 0 10 3 7
E 7 5 7 2 9
55) A departmental head has three subordinates and four tasks for completion. The
subordinates differ in their capabilities and the tasks differ in their work content. With
the performance matrix given below, which three of the four tasks should be assigned
to the subordinates?
Subordinates
1 2 3
A 9 12 11
B 8 13 7
Tasks C 20 12 13
D 21 15 17
56) A fast food chain wants to build four stores. In the past, the chain has used six different
construction companies and having been satisfied with each has invited them to bid for each
job. The final bids (in thousands of rupees) are shown in table below:
Construction company
1 2 3 4 5 6
1 85.3 90 87.5 82.4 89.1 91.3
Stores 2 78.9 84.5 99.4 80.4 89.3 88.4
3 82 31.3 28.5 66.5 80.4 109.7
4 84.3 34.6 86.2 83.3 85 85.5
Since the fast food chain wants to have each of the new stores ready as quickly as
possible, it will allot at most one job to a construction company. What assignment will
result in the minimum total cost?
57) Five jobs are to be processed and five machines are available. Any machine can process any
job with the resulting profit (in ) is as follows:
Jobs
1 2 3 4 5
A 15 21 6 4 9
B 3 40 21 10 7
Machines C 9 6 5 8 10

60
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

D 14 8 6 9 3
E 21 16 18 6 4
What is the maximum profit that can be expected if optimal assignment is made?
58) Five jobs are to be assigned to five persons, time taken in minutes by each of them on
each job is given below:
Jobs
1 2 3 4 5
A 16 13 17 19 20
B 14 12 13 16 17
Persons C 14 11 12 17 18
D 5 5 8 8 11
E 5 3 8 8 10
Work out the optimum assignment and the total minimum time taken.
59) A company has 5 jobs to be processed on 5 machines. The following table gives the
time required in hours when the ith job is assigned to jth machine. How should the jobs
be assigned to the machines so as to minimize the overall time? What is the minimum
time required?
Machine
A B C D E
1 160 130 175 190 200
2 135 120 130 160 175
Job 3 140 110 155 170 185
4 50 50 80 80 110
5 55 55 70 80 105
60) A company has a team of four salesman and there are four districts where the company wants to start
its business. After taking into account the capabilities of salesman and the nature of districts the
company estimates that the profit per day in Rs. For each salesman in each district is as below:
District
1 2 3 4
A 16 10 14 11
B 14 11 15 15
Salesman C 15 15 13 12
D 13 12 14 15
Find the assignment of salesman to various districts which will yield maximum profit.
61) Five lectures by experts are to be scheduled in the afternoons of five week-days (one
on each day). The table below indicates the number of students who will be absent
given the combination of a lecture and a day.
Lectures
1 2 3 4 5

61
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

Mon 3 2 3 9 10
Tue 11 5 9 10 2
Day Wed 1 3 8 2 4
Thu 8 11 10 5 2
Fri 8 6 5 6 9
Using assignment method, schedule the lectures in such a way that the total number of
students who will miss the lectures will be a minimum.
62) Five machines are to be assigned to five jobs with the following cost of assignment. Determine the
optimum assignment of machines to jobs.
Jobs
J1 J2 J3 J4 J5
M1 11 17 8 16 20
M2 9 7 12 6 15
Machines M3 13 16 15 12 16
M4 21 24 17 28 26
M5 14 10 12 11 15
Also find the minimum cost of assignment.
63) A city corporation has decided to carryout road repairs on four main roads of the city.
The government has agreed to make a special grant of Rs.50 lakhs towards the cost
with a condition that the repairs must be done at the lowest cost. If conditions warrant,
then the supplementary grant will also be considered favourably. The corporation has
floated tenders and five contractors have sent their bids. In order to expedite work,
one road will be awarded to only one contractor.
Cost of repairs (Rs. in lakhs)
Cotractors/road R1 R2 R3 R4
C1 9 14 19 15
C2 7 17 20 19
C3 9 18 21 18
C4 10 12 18 19
C5 10 15 21 16
(i) Find the best way of assigning the repair work to the contractors and the
corresponding costs, (ii) Is it necessary to seek supplementary grants?, if so what
should be the amount sought?, (iii) Which of the five contractors will be unsuccessful
in his bid?
64) An air freight company picks up and delivers freight where customers require.
Company has two types of aircrafts X and Y with equal loading capacities but
different operating costs. These are as shown below.
Type of Cost per km in
Aircraft
Empty Loaded

62
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

X 1.00 1.50
Y 2.00 4.00
The present four locations of the aircrafts which the company is having are as shown
below.
J → X, K → Y, L → Y, M → X
Four customers of the company located at A, B. C, D wants to transport nearly the
same size of load .to their final destination. The final destinations are at distances of
600, 300, 1000 and 500 km from loading points A, B, C and D respectively. Distance
in km between location of aircraft and loading points are as follows.
A B C D
J 300 200 400 100
K 300 100 300 300
L 400 100 100 400
M 200 200 300 200
Determine the optimum allocation
65) An air freight company picks up and delivers freight where customers require.
Company has two types of aircrafts X and Y with equal loading capacities but
different operating costs as given below.
Type of Cost per km in
Aircraft
Empty Loaded
X 1.00 2.00
Y 1.50 3.00
The present four locations of the aircrafts which the company is having are as shown
below.
J → X, K → Y, L → Y, M → X
Four customers of the company located at A, B. C, D wants to transport nearly the
same size of load .to their final destination. The final destinations are at distances of
600, 300, 1000 and 500 km from loading points A, B, C and D respectively. Distance
in km between location of aircraft and loading points are as follows.
A B C D
J 300 200 400 100
K 300 100 300 300
L 400 100 100 500
M 200 200 400 200
Determine the allocation, which minimizes the total cost of transportation.
66) An airline that operates seven days a week has the time table shown below. The crew
must have a minimum layover time of 90 minutes between the flights. Obtain the

63
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

pairing of flights that minimizes layover away from home, also mention the town
where crew should be based.
Flight From To B Flight From To A
No. A No. B
1 6.00 8.30 A 7.30 9.30
2 8.15 10.45 B 2.15 11.15
3 13.30 16.00 C 16.30 18.30
4 15.00 17.30 D 20.00 22.00
67) An airline company has two way flights between cities A and B. The crew based in
city A (or B) and flying to city B (or A) must return to city A (or B) on a later flight,
either on the same day or the following day. The crew must be provided with at least
90 min lay over time. The time table of flights is as given below:
Flight Departs Arrives Flight Departs Arrives
No. from A at B No. from B at A
1 6.00 8.30 10 7.30 9.30
2 8.15 10.45 20 9.15 11.15
3 13.30 16.00 30 16.30 18.30
4 15.00 17.30 40 20.00 22.00
The objective is to pair the flights so as to minimize the total lay-over time by all the
crews. Solve the problem as assignment model.
68) An airline operates 7 days a week has the time-table shown below. Crew must have a
minimum layover time of 1 hour between the flights. Obtain the pairing of flights that
minimizes the layover time away from home. Crew will be placed at the city that
results in minimum layover time. For each pair mention the town where the crew
should be based.
Delhi - Jaipur Jaipur - Delhi
Flight Departure Arrival Flight Departure Arrival
No. No.
1 7 AM 8 AM 101 8 AM 9 AM
2 8 AM 9 AM 102 9 AM 10 AM
3 1 PM 2 PM 103 12 Noon 1 PM
4 6 PM 7 PM 104 5 PM 6 PM
69) An airline operates 7 days a week has the time-table shown below. Crew must have a minimum layover
time of 5 hours between the flights. Obtain the pairing of flights that minimizes the layover time away
from home. Crew will be placed at the city that results in minimum layover time.
Chennai – Mumbai Mumbai - Chennai
Flight Departure Arrival Flight Departure Arrival
No. No.
A1 6 AM 8 AM B1 8 AM 10 AM
A2 8 AM 10 AM B2 9 AM 11 AM
A3 2 PM 4 PM B3 2 PM 4 PM
A4 8 PM 10 PM B4 7 PM 9 PM

64
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

Answer: A1 – B3, A2 – B4, A3 – B1, A4 – B2, Minimum Layover time 40 Hours

70) An airline operates 7 days a week has the time-table shown below. Crew must have a
minimum layover time of 3 hours between the flights. Obtain the pairing of flights
that minimizes the layover time away from home. Crew will be placed at the city that
results in minimum layover time. For each pair mention the town where the crew
should be based.
Delhi – Calcutta Calcutta - Delhi
Flight Departure Arrival Flight Departure Arrival
No. No.
101 7 AM 9 AM 201 9 AM 11.30 AM
102 9 AM 11 AM 202 10 AM 12.30 PM
103 1.30 PM 3.30 PM 203 3.30 PM 6 PM
104 7.30 PM 9.30 PM 204 8 PM 10.30 PM
Answer: 101 – 201 or 202, 102 – 203, 103 – 204, 104 - 202 or 201, Minimum
Layover time 35 ½ Hours
71) A trip from Chennai to Bangalore takes six hours by bus. The time table of bus
services in both directions is given below:
Chennai - Bangalore Bangalore - Chennai
Route No. Departure Arrival Route No. Departure Arrival
A 6.00 12.00 1 5.30 11.30
B 7.30 13.30 2 9.00 15.00
C 11.30 17.30 3 15.00 21.00
D 19.00 1.00 4 18.30 0.30
E 0.30 6.30 5 24.00 6.00
The cost of providing this service by the transport company depends upon the time
spent by the bus crew (driver and conductor) away from their places in addition to
service times. There are five crews, every crew should be provided with 4 hours of
rest before return trip and should not wait for more than 24 hours for the return trip.
The company has residential facilities for the crew at Chennai and Bangalore. Obtain
pairing of routes so as to minimize the waiting time.
72) A trip from Bangalore to Chennai takes six hours by bus. The time table of bus
services in both directions is given below:
Bangalore - Chennai Chennai - Bangalore
Route No. Departure Arrival Route No. Departure Arrival
A 06.00 12.00 1 05.30 11.30
B 07.30 13.30 2 09.00 15.00
C 11.30 17.30 3 15.00 21.00
D 19.00 01.00 4 18.30 00.30
E 00.30 06.30 5 24.00 06.00

65
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

The cost of providing this service by the transport company depends upon the time
spent by the bus crew (driver and conductor) away from their places in addition to
service times. There are five crews, every crew should be provided with 4 hours of
rest before return trip and should not wait for more than 24 hours for the return trip.
The company has residential facilities for the crew at Bangalore and Chennai. Obtain
pairing of routes so as to minimize the waiting time.
73) Formulate the following assignment problem as a general LPP Model.
Operator
1 2 3
A 3 6 9
Machine B 6 4 2
C 9 5 7
74) Formulate the following assignment problem as a general LPP Model.

1 2 3
A 5 6 4
Job B 6 5 7
C 8 7 7
75) Formulate the following assignment problem in the standard format of LPP.
Job
1 2 3
1 4 3 9
Worker 2 5 8 2
3 5 6 1
76) Formulate the following assignment problem as a general LPP Model.
Operator
1 2 3
A 5 6 4
Machine B 6 5 3
C 7 6 6
77) A college athletic conference has 6 basket ball officials. It must assign 3 conference
games. Two officials must be assigned to each game. The conference office desires to
assign the officials such that the total distance travelled by all the six officials will be
minimized. The distance each official would have to travel to each game are given
below:
Officials
1 2 3 4 5 6
A 20 40 60 20 70 80
Games B 45 90 70 60 15 25

66
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya
 Operations Research

C 10 70 30 40 50 35
The conference office has decided not to assign the official 4 to game A because of
the previous conflicts with one of the coaches. Determine the optimal assignment.
78) Alpha Corporation has four plants each of which can manufacture any one of four products. Product
costs differ from one plant to another as do sales revenues. Given the revenue and cost data below,
obtain which product each plant should produce maximum profit.
Production cost (Rs.1000’s) Sales Revenues (Rs.1000’s)
Product Product
1 2 3 4 1 2 3 4
A 49 60 45 51 A 50 68 49 52
B 55 63 48 69 B 60 70 51 74
Plant C 52 62 49 68 Plant C 55 67 53 70
D 55 64 48 66 D 58 65 54 69
Answer: A -2, B – 4, C – 1, D – 3, Total Profit 22000

67
Compiled by Dr. B. Jayashankara, Professor (Retd.), Dept. of Automobile Engineering, P.E.S. College of Engineering, Mandya