PRESENTATION BY:-

SHUBHAM GUPTA
SUMIT MALIK
VISHAL GOHAN
 INTRODUCTION TO ASSIGNMENT
PROBLEM
• Imagine, if in a printing press there is one machine and one
operator is there to operate. How would you employ the worker?
• Your immediate answer will be, the available operator will
operate the machine.
• Again suppose there are two machines in the press and two
operators are engaged at different rates to operate them. Which
operator should operate which machine for maximising profit?
• Similarly, if there are n machines available and n persons are
engaged at different rates to operate them. Which operator
should be assigned to which machine to ensure maximum
efficiency?
• While answering the above questions we have to think about the
interest of the press, so we have to find such an assignment by
which the press gets maximum profit on minimum investment.
• Such problems are known as "assignment problems".
 USES OF ASSIGNMENT PROBLEM
There are number of decision making situations
where assignment model can be used:-

• Assignment of:-
– Machines to jobs
– Salesmen to sales territories
– Workers to tasks
– Vehicles to routes
– And so on…..
 FORMULATION OF ASSIGNMENT
PROBLEM
• Suppose there are n machines available on which n jobs
can be performed completely and independently.

• The assignment of machine to different jobs must be on

one-to-one basis i.e. each machine will be assigned only to
one job.

• The cost of performing any job on any machine is known

and independent of each other.

• The objective of this assignment problem is to assign these

n machines to n jobs so as to minimize total assignment
cost.
 EXAMPLE
Machines
Jobs  I II III IV V

A 6 12 3 11 15

B 4 2 7 1 10

C 8 11 10 7 11

D 16 19 12 23 21

E 9 5 7 6 10
STEPS IN HUNGARIAN METHOD
(Taking previous example as an assignment problem)

STEP 1. Row reduction: Select the smallest element in each row and
subtract it from every element of that row.

Machines
Jobs  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
STEP 2. Column reduction: Select the smallest
element in each column and subtract it from
every element of that column.

Machines
Jobs  I II III IV V

A 2 9 0 8 8

B 2 1 6 0 5

C 0 4 3 0 0

D 3 7 0 11 5

E 3 0 2 1 1
 STEP 3. Make assignment:
• Starting with first row of the matrix received in second step,
examine the rows one by one until a row containing exactly
one zero is found. Then an experimental assignment indicated
by ‘ ’ is marked to that zero.
• Now cross all the zeros in the column in which the assignment
is made. This procedure should be adopted for each row
assignment.
• When the set of rows has been completely examined, an
identical procedure is applied successively to columns.
• Starting with column 1, examine all columns until a column
containing exactly one zero is found. Then make an
experimental assignment in that position and cross other
zeros in the row in which the assignment was made.
• Continue these successive operations on rows and columns
until all zero’s have either been assigned or crossed-out.
 STEP 4:- Draw minimum lines to cover zero’s

In order to cover all the zero’s at least once you may adopt
the following procedure.
(i) Mark ( ) to all rows in which the assignment has
not been done.
(ii) See the position of zero in marked ( ) row and then
mark ( ) to the corresponding column.
(iii) See the marked ( ) column and find the position of
assigned zero’s and then mark ( ) to the
corresponding rows which are not marked till now.
(iv) Repeat the procedure (ii) and (iii) till the completion
of marking.
(v) Draw the lines through unmarked rows and marked
columns.
 STEP 5.:- Select the smallest element from the
uncovered elements.
(i) Subtract this smallest element from all those
elements which are not covered.
(ii) Add this smallest element to all those elements
which are at the intersection of two lines.

Machines
Jobs  I II III IV V

A 0 7 0 6 6

B 2 1 8 0 5

C 0 4 5 0 0

D 1 5 0 9 3

E 3 0 4 1 1
STEP 6:- Thus we have increased the number of zero’s.
Now, modify the matrix with the help of step II and find the
required assignment.
So assignment will be as follows:

(i) A ------ I
(ii) B ------ IV
(iii) C ------ V
(iv) D ------ III
(v) E ------ II

Thus from the cost matrix the minimum cost=

6+1+11+12+5= Rs 35
TYPES OF ASSIGNMENT PROBLEMS

• MINIMIZATION CASE
• MAXIMIZATION CASE
• UNBALANCED ASSIGNMENT PROBLEM
• RESTRICTIONS ON ASSIGNMENT
• TRAVELLING SALESMAN PROBLEM
• AIRLINE CREW ASSIGNMENT
 INTRODUCTION
• This problem arises when a salesman has certain
number of cities to visit in his assigned territory.

• He wishes to visit each city once and only once and

arriving back at the city from where he started.

• He knows the distance, cost or time of journey between

every pair of cities.

• He wishes to determine the tour schedule that represent

the least distance, cost or time.
 PROBLEM
Madhur industries ltd., jaipur
engaged in manufacturing of CITY A B C D E
plastic goods. The co. is
facing a problem in assigning
route to its salesman so that
A ----- 4 7 3 4
each and every city is
covered at minimum possible B 4 ----- 6 3 4
distance. Following table
shows the distance between C 7 6 ----- 7 5
5 cities (in 100 kms). If the
salesman starts from city A D 3 3 7 ----- 7
and has to come back to city
A. which route should he
select so that total distance
E 4 4 5 7 -----
travelled is minimum.
 1. ROW REDUCTION

CITY A B C D E
A ----- 1 4 0 1

B 1 ----- 3 0 1

C 2 1 ----- 2 0

D 0 0 4 ----- 4

E 0 0 1 3 -----
 2. COLUMN REDUCTION

CITY A B C D E
A ----- 1 3 0 1

B 1 ----- 2 0 1

C 2 1 ----- 2 0

D 0 0 3 ----- 4

E 0 0 0 3 -----
3. ASSIGNMENT
4. CROSSING UNTICKED ROWS
AND TICKED COLUMNS
 6. ASSIGNMENT

CITY A B C D E
A ----- 0 2 0 0

B 0 ----- 1 0 0

C 2 1 ----- 3 0

D 0 0 3 ----- 4

E 0 0 0 4 -----
The next best solution can be obtained by bringing the
next minimum non-zero element i.e. 1 into the solution.
But 1 occurs at two places. We shall consider the
cases until the acceptable solution is obtained.

CITY A B C D E
A ----- 0 2 0 0

B 0 ----- 1 0 0

C 2 1 ----- 3 0

D 0 0 3 ----- 4

E 0 0 0 4 -----
 CITY TIME

A TO D 3
D TO B 3
B TO C 6
C TO E 5
E TO A 4__
21 hrs.
Case Study
 Kingfisher Airlines

Kingfisher Airlines is an airline group based in India,

established in 2003. Kingfisher Airlines serves 63 domestic
destinations and 8 international destinations in 8 countries
across Asia and Europe. There is always a problem
regarding the un-appropriate and costly expenditure that is
being made on the crew throughout, which is eating down
the profits of the company. One such route which is
proving to be a costly affair for the company is between
Chennai-Mumbai-Chennai. The average expenditure
incurred during the month on the crew between these
cities is abnormally high and a higher number of the crew is
being employed.
It operates 7 days a week between Chennai & Mumbai according
to the time-table shown below.

Flight Chennai Mumbai Flight Mumbai Chennai

no. departur arrival no. departur arrival
e e
1 7:00 am 9:00 am 101 9:00 am 11:00
am
2 9:00 am 11:00 102 10:00 12:00
am am noon
3 1:30 pm 3:30 pm 103 3:30 pm 5:30 pm

4 7:30 pm 9:30 pm 104 8:00 pm 10:00

pm
 The airlines has a policy that the crews must have a
minimum layover time of 6 hours between two
consecutive flights. But this layover time is to be
minimized to the extent possible. Moreover the
airlines has crew based in both the cities of Chennai
& Mumbai. A policy is required to be framed
according to the timetable for the optimum utilization
of the crew and selecting cities from where the crew
is based will prove to be of optimum use.
Questions
(1.) Obtain the flight pairing that minimizes layover
time.
(2.) Find the cities where the crew can be based for
the above pairing.
 Solution
If the crew is based in Chennai then the
layover period for the different pairings of
flights is given by the following table:
Flight 101 102 103 104
no.
1 24 25 6.5 11
2 22 23 28.5 9
3 17.5 18.5 24 28.5
4 11.5 12.5 18 22.5
If the crew is based in Mumbai then the layover period for
the different pairings of flights is given by the following
table:

Flight 101 102 103 104

no.
1 20 19 13.5 9
2 22 21 15.5 11

3 26.5 25.5 20 15.5

4 8.5 7.5 26 21.5

Minimum Layover Period

Flight 101 102 103 104

no.
1 20m 19m 6.5c 9m
2 22c/m 21m 15.5c 9c
3 17.5c 18.5c 20m 15.5m
4 8.5m 7.5m 18c 21.5m
APPLYING HAM
Step 1 Row Reduction

Flight 101 102 103 104

no.
1 13.5 12.5 0 2.5
2 13 12 6.5 0
3 2 3 4.5 0
4 1 0 10.5 14
Step 2 Column Reduction
Flight
No. 101 102 103 104
1 12.5 12.5 0 2.5
2 12 12 6.5 20
3 1 3 4.5 0
4 0 0 10.5 14
Step 3 Making Zero Assignments

Flight
No. 101 102 103 104
1 12.5 12.5 0 2.5
2 12 12 6.5 0
3 1 3 4.5 0
4 0 0 10.5 1.4
 Step 4

Flight
No. 101 102 103 104
1 12.5 12.5 0 2.5
2 12 12 6.5 0 √

3 1 3 4.5 0 √

4 0 0 10.5 1.4
√
Flight
No. 101 102 103 104
1 12.5 12.5 0 3.5
2 11 11 5.5 0
3 0 2 3.5 0
4 0 0 10.5 15
Final Zero Assignment Solution

Flight
No. 101 102 103 104
1 12.5 12.5 0 3.5
2 11 11 5.5 0
3 0 2 3.5 0
4 0 0 10.5 15
The Optimum Assignment Schedule Is

Flight Crew Base Layover Time

1 -> 103 Chennai 6.5
2 -> 104 Chennai 9
3 -> 101 Chennai 17.5
4 -> 102 Mumbai 7.5

    40.5 hours
 Quick Revision
 Check whether the problem is of minimization or maximization.
 Construct the effectiveness matrix if not already given
 Row reduction
 Column reduction
 Is zero assignment possible
Yes No
Put square over the single zero in (i) Draw minimum number of lines to
column and cross out all zeros (if cover all the zeros
any) of the corresponding column. (ii) Choose the least uncovered element
Repeat same for columns. (iii) Subtract this from the uncovered
elements and add it to the elements at
intersection of the lines.
Put square over the zero and cross out all
zeros (if any) of the corresponding
column (zero assignments)
THANK YOU