Scribd
Upload
42 views20 pages

Unit II 3 AM

The document discusses the assignment model in operations research. It describes an assignment problem as having machines that each perform one job at a time, with the goal being to assign jobs to machines at the lowest total cost. The Hungarian method is presented as an algorithm to solve assignment problems using a matrix to track costs and find the optimal assignment that minimizes total cost. Examples of applying assignment models include assigning salespeople to territories or vehicles to routes.

Uploaded by

Pravah Shukla
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
42 views20 pages

Unit II 3 AM

The document discusses the assignment model in operations research. It describes an assignment problem as having machines that each perform one job at a time, with the goal being to assign jobs to machines at the lowest total cost. The Hungarian method is presented as an algorithm to solve assignment problems using a matrix to track costs and find the optimal assignment that minimizes total cost. Examples of applying assignment models include assigning salespeople to territories or vehicles to routes.

Uploaded by

Pravah Shukla
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 20

Operations Research

MBA-024
UNIT II

ASSIGNMENT MODEL
• Suppose there are 5 machines and 5 jobs to be
performed.
• 1 machine can do only 1 job at a time.
• How the machines should be assigned to the
jobs?
• Given – the cost of performing a job on a
machine.
• An Assignment Problem (AP) is always square.
• The assignment is done on a one-to-one
matching basis.
• Only one allocation is possible in a given row or
column.
• The AP is inherently degenerate, as the
assignment is done on a one-to-one matching
basis. (In the above 5 machine 5 job problem,
there would be 25 cells, but allocation can be
made only in 5 cells, whereas 9 cells should be
allocated.)
• Total number of assignments possible = n!
Mathematical Formulation
Hungarian Method
Machine
X Y Z
Job
A 25 31 35
B 15 20 24
C 22 19 17
• Machine opportunity and job opportunity cost to be
determined.
• The minimum element of a particular row or column to
be subtracted from all elements of that row or column.
Machine
X Y Z
Job
A 25 31 35
B 15 20 24
C 22 19 17
Machine
X Y Z
Job
A 25 31 35
B 15 20 24
C 22 19 17
Machine
X Y Z
Job

A 25-25 31-25 35-25

B 15-15 20-15 24-15

C 22-17 19-17 17-17


Job Opportunity Cost
Machine
X Y Z
Job
A 0 6 10
B 0 5 9
C 5 2 0
1st Reduced Cost Matrix
Machine
X Y Z
Job
A 0 6 10
B 0 5 9
C 5 2 0
Machine Opportunity Cost
Machine
X Y Z
Job
A 0 4 10
B 0 3 9
C 5 0 0
2nd Reduced Cost (Total Opportunity Cost) Matrix
• Optimal assignment is that
assignment where total
0 4 10 opportunity cost is zero.
• We draw horizontal and
0 3 9 vertical lines so as to cross
all the zero elements using
5 0 0 the minimum number of
lines.
• Optimal assignment is that
0 4 10 assignment where total
opportunity cost is zero.
• We draw horizontal and
0 3 9 vertical lines so as to cross
all the zero elements using
5 0 0 the minimum number of
lines.
• If the minimum number of lines required to do
so is equal to the number of rows or columns,
then optimum allocation is possible.
• Optimal assignment is that
0 4 10 assignment where total
opportunity cost is zero.
• We draw horizontal and
0 3 9 vertical lines so as to cross
all the zero elements using
5 0 0 the minimum number of
lines.
• If the minimum number of lines required to do
so is equal to the number of rows or columns,
then optimum allocation is possible.
• In this case it is not possible.
• We identify the minimum
0 4 10 element not covered by
lines.

0 3 9
5 0 0
• We identify the minimum
0 4 10 element not covered by
lines.
• In this case it is 3.
0 3 9
5 0 0
0 4 10
0 3 9
5 0 0
• We subtract it from…
Assignment Model: Applications
• Assign salespeople to sales territories.
• Assign vehicles to routes.
• Assign accountants to client accounts.
• Assign contracts to bidders through
systematic evaluation of bids from competing
suppliers.
• Assign naval vessels to patrol sectors.
• Schedule teachers to classes.
Assignment Model: Applications
• Matching men to machines according to
pieces produced per hour by each individual
on each machine.
• Matching teams to projects by the expected
cost of each team to accomplish each project.

You might also like