Scribd
Upload
117 views

Assignment

The document discusses the assignment problem, which involves assigning objects like people, machines, or tasks in a way that minimizes costs or time. It provides an example of assigning 5 men to 5 jobs based on the time each takes, and explains how to use the Hungarian method to solve assignment problems by finding the optimal assignments that minimize total time or cost. It also discusses variations like unbalanced assignments where the number of rows and columns differ, and restrictions on certain assignments.

Uploaded by

Aditi Gupta Singh
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
117 views

Assignment

The document discusses the assignment problem, which involves assigning objects like people, machines, or tasks in a way that minimizes costs or time. It provides an example of assigning 5 men to 5 jobs based on the time each takes, and explains how to use the Hungarian method to solve assignment problems by finding the optimal assignments that minimize total time or cost. It also discusses variations like unbalanced assignments where the number of rows and columns differ, and restrictions on certain assignments.

Uploaded by

Aditi Gupta Singh
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 11

ASSIGNMENT PROBLEM

Assignment Problem –
- A variant to Transportation Problem

 Assigning men, machinery, people to


different tasks.
 Sales person – territory
 Labour- Machinery
 Clerk- specific work
 Salesperson- sales counter
Assignment Problem –
- A variant to Transportation Problem

 Each assignment problem has


associated with it a table, or matrix

 Generally,
ROWS : contain the objects or people we
wish to assign
COLUMNS : the tasks or things we want
them assigned to
Rules for
HAM (Hungarian Method)

I. Find the Cost Matrix


Construct the Cost Matrix.
If Number of Rows ≠Number of columns,
then add a dummy row / column

II. Find the Opportunity Cost Matrix


Row Reduction : Identify the smallest cost in every row
and subtract it from each element of that
particular row.
Column Reduction : Identify the smallest cost in the
each column and subtract it from each element
of that particular column.
*Each row/ column should have at least one zero (0)
element.
HAM (Hungarian Method)
III. Make Assignments in Opportunity Cost
Matrix
a) Identify a row which has only one zero. Mark
a 0 to that zero and X to all other zeros
in the same row and column.
b) Similarly do it for columns.
c) If two zeros are present mark them
arbitrarily.

IV. Testing Optimality


a) If. No. of assignments in each row and column is
one, then its optimal.
b) If a zero was chosen arbitrarily, an ALTERNATE
SOLUTION is available which is also Optimal
c) If a row/ column has no assignment, i.e. no. of
assignments are not equal to no. of rows and
columns, proceed to step V .
HAM (Hungarian Method)
V Revise Opportunity Cost Matrix
Draw a set of horizontal / Vertical lines to cover all
zeroes in the revised cost matrix
a) For each row, in which no assignment is made
mark a tick ( )
b) For all the ticked row, if any zero is present
mark a tick ( ) to its column.
c) In the ticked column, if any assigned zero is
present, tick the row in which that assigned
zero is present.
d) Repeat this till, no row/ column can be
marked.
e) Draw a line in marked column and unmarked
rows.

*If no. of lines = no. of columns/rows, its optimal


solution else proceed further.
HAM (Hungarian Method)
VI. Develop the new revised Opportunity
Cost Matrix

 From the uncovered elements choose the


smallest element
 Subtract this from all the uncovered elements.
 Add to all those elements which are covered
by two lines. i.e. on the intersection points of
lines.

Now again make assignments, and see if it’s the


optimal solution.
Five men are available to do five different jobs. From past records, the time
(in hours) that each man takes to do each job is known and is given as
follows

JOBS
I II III IV V
A 10 5 13 15 16
B 3 9 18 13 6
MEN C 10 7 2 2 2
D 7 11 9 7 12
E 7 9 10 4 12
Find out how men should be assigned the jobs in a way that will minimize
the total time taken.
Using the following cost matrix determine
a) Optimal job assignment
b) The cost of assignments

Jobs
I II III IV V
A 10 3 3 2 8
B 9 7 8 2 7
MEN C 7 5 6 2 4
D 3 5 8 2 4
E 9 10 9 6 10
 Un Balanced Assignment Problem
If No. of rows ≠ No. of columns, add a dummy row/
column
 Restrictions on Assignments

4 new machines are to be installed in a machine shop. There are 5 vacant


places A,B,C,D and E available .Because of limited place machine M2 cant
be placed at C and M3 cant be placed at A. the cost of locating the machine
at a place in hundreds is given below.

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

Find the optimal assignment schedule.


MAXIMIZATION
1 2 3 4 5 Flight Numbers

A 8 2 X 5 4
B 10 9 2 8 4
C 5 4 9 6 X PILOTS
D 3 6 2 8 7
E 5 6 10 4 3

An airline company has drawn up a new flight schedule that involves five flights.
To assist in allocating five pilots to the flights, a matrix of preferences has been
taken.

What should be the allocation of the pilots to flights in order to meet preferences?

You might also like