Dr. Sachin C.

Vyavhare
[email protected]
Q.1) Explain the Hungarian method/ Flood’s Technique to solve assignment problems.

Assignment Models
Assignment is a typical optimisation technique practically useful in a situation a certain number of tasks
are required to be assigned to an equal number of facilities, on to one basis, so that the resultant
effectiveness is optimised. E.g. Jobs to be assigned machines or workers, salesmen to the sales
territories, vehicles to routes etc.
The problem of assignment arises because available resources such as men, machines have varying
degree of efficiency for performing different activities. Hence cost, profit or time for performing
different activities.

Hungarian Method of Solution / Flood’s Technique

Step 1: Develop cost matrix by using the information given in the problem
Check— Number of rows and number of columns
If Number of rows = number of columns --- This is a Balanced Assignment Problem --- Go
To Step 2.
If NOT--- This is an Unbalanced Assignment Problem --- Hence, ADD DUMMY Row OR
Column with all the values ‘0’.
Order of the matrix is n x n.
Hence, n =

Step 2: Develop Opportunity Cost Matrix

a) Row Reduction: Identify the smallest elements of each row ; subtract the smallest
element in each row from every element in the respective rows.
b) Column Reduction : Identify the smallest elements of each column ; subtract the
smallest element in each column from every element in the respective columns.

Check --- whether each row and each column has at least one ‘zero’.

Step 3: Draw minimum number of vertical and horizontal lines necessary to cover all the
zeroes in the reduced matrix, by inspection. Start with the row or column having maximum
number of zeroes to draw the lines. Now,

a) If the number of lines = number of rows/columns (i.e. n), it implies that the solution is
optimum. Then go to step 4.
b) If the number of lines is less than n, then the solution is not optimum and needs further
improvement; then go to step 5.

Step 4: Make the assignments as follows:

(i) Check the rows successively. Mark a square around a ‘single unmarked (i.e. free)
zero' in a row (if present) and cancel all the other zeroes in its corresponding column.

(ii) Check the columns successively, Mark a square around a ‘single unmarked zero' in
a column (if present) and cancel all other zeroes in its corresponding row.

Dr. Sachin C. Vyavhare

[email protected]
Dr. Sachin C. Vyavhare
[email protected]
(iii) Repeat steps (i) and (ii) above until all the zeroes in the matrix are either marked
with a square (i.e. assigned) or cancelled out.

Now, the squared zeroes represent the assignments and if there is exactly one
assignment in’ each row and column, it indicates an ‘optimum solution. Consider then
the corresponding elements in the original matrix to find out the optimum value of the
pay-off (time, cost etc.)

Step 5: If the solution is not optimum, then

(i) Select the smallest uncovered element of the reduced matrix. |

(ii) Subtract it from all the uncovered elements and add it to the elements at the
intersection of the lines, keeping other elements unchanged.

Then, go to step 3 (draw lines) and repeat the procedure until the number of assignments
is equal to the number of rows or columns i.e. the optimum solution is obtained.

Note: If we make assignments without drawing the lines, then we get n assignments
(one in each row and column) if the solution is optimum. Otherwise we get less than n
number of assignments which indicates that the solution is not optimum and it needs
further improvement.

Q.1) The Computer centre has THREE expert programmers . The centre wants three applications
programmes to be developed .the head of the computer centre estimate the computer time In minutes
required by the experts for the application programmes as follows
Programmers

A B C
1 120 100 80
Pragrammes 2 80 90 110
3 110 140 120
Assign the programmers to the programmes in such a way that the total computer time is minimum.
Q.2) Consider a job which requires four activities- Cutting, Assembly, Finishing and Packing. Four
workers are employed who can do all these activities. The time required by each of them (in minutes)
to perform each of the activities are as follows:

Activities Workers
1 2 3 4
C 14 12 15 15
A 21 18 18 22
F 14 17 12 14
P 6 5 3 6

Dr. Sachin C. Vyavhare

[email protected]
Dr. Sachin C. Vyavhare
[email protected]
Q.3) A city corporation has decided to carry out road repairs on main arteries of the city . The
government has agreed to make special grant of Rs. 50 lakh towards the cost with a condition that the
repairs be done at the lowest cost and quickest time. If the condition warrant, a supplementary token
grant will also be considered favorably. The corporation has floated tenders and five contractors have
sent in their bids. In order to expedite work, one road will be awarded to only one contractor.
a) Find the best way of assigning the repair work to the contractors and the cost
b) If it is necessary to seek supplementary grants, what should be the amount sought?
c) Which of the five contractors will be unsuccessful in his bid?

Cost of Repair (Rs in lakh)

Roads
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

Q.4) Solve the following problem for maximizing the production output. The data refers to the
production of an article for the given operators and machines.

Operators Machines
A B C D
1 10 5 7 8
2 11 4 9 10
3 8 4 9 7
4 7 5 6 4
5 8 9 7 5

Q.5) Consider a problem of assigning four clerks to four tasks. The time (hours) required to complete
the tasks are given. Clerk 2 cannot be assigned to task A and clerk 3 cannot be assigned to task B.
Find the optimum assignment schedule.

Clerks Tasks
A B C D
1 4 7 8 6
2 - 8 7 4
3 3 - 8 3
4 6 6 4 2

Dr. Sachin C. Vyavhare

[email protected]
Dr. Sachin C. Vyavhare
[email protected]

Q.6) Solve the following problem for maximizing the production output. The data refers to the
production of an article for the given operators and machines.

Operators Machines
A B C D
1 10 5 7 8
2 11 4 9 10
3 8 4 9 7
4 7 5 6 4
5 8 9 7 5

Q.7) The FIVE Jobs are to be assigned to Four operators. Operator 1 and 3 can not be assigned to Job
3 and 4 respectively due to technical reason. The table/matrix shows the time(hours) required by
Operator to perform the job.

J1 J2 J3 J4 J5
O1 27 18 ---- 20 21
O2 31 24 21 12 17
O3 20 17 20 ---- 16
O4 20 28 20 16 27

a) Find the best way of assigning the operator to the job and the time?
b) Which of the Job is not completed due to non-availability of operator?

Q.8) A company has four territories and four salesmen available for an assignment. Find the assignment
to maximize the sales. Sales Figure’s in ‘000 INR.

Territories
I II III IV
A 42 35 28 21
B 30 25 20 15
C 30 25 20 15

D 24 20 16 12

Dr. Sachin C. Vyavhare

[email protected]
Dr. Sachin C. Vyavhare
[email protected]
Q.9) A method engineer wants to assign four new methods to three work-centre. The assignment of
new methods will increase production and they are given below. If one method can be assigned to work-
centre. Determine the optimal assignment.
Increase in production (units)
Work-centre
P Q R
A 10 7 8
B 8 9 7
C 7 12 6

D 10 10 8

Dr. Sachin C. Vyavhare

[email protected]