Assignment Problem
Uploaded by
Dhaarani PushpamAssignment Problem
Uploaded by
Dhaarani PushpamAssignment Problem
Assignment Problem
• An Assignment Problem is a special type of Transportation Problem in
Operational Research that deals with assigning n origins (workers or
instances) to n destinations (jobs or machines).
• The goal of the assignment problem is to determine the minimum cost of the
assignment.
• Each origin must be assigned to one and only one destination and each
destination must be assigned to one and only one origin.
• The solution to the assignment method can be found using the Hungarian
Method.
• Transportation methods can be used to find the solutions to assignment
problems, but assignment methods can’t be used to find the solutions to
transportation problems.
Applications of Assignment Problem
Difference between Transportation and
Assignment Problem
Parameters Transportation Problem Assignment Problem
It deals with the optimal distribution of goods or resources from It is a special type of transportation problem that
Definition multiple sources (factories and warehouses) to multiple destinations assigns n origins (workers or instances) to n
(retail stores or customers). destinations (jobs or machines).
Minimize total cost or time associated with completing
Objective Minimize the total transportation cost
tasks
1. Supply Constraints (The amount supplied from each source)
1. Each task is assigned to exactly one resource.
Constraints 2. Demand Constraints (Total amount demanded at each
2. Each resource is assigned to exactly one task.
destination).
Types Balanced and Unbalanced Balanced and Unbalanced
Northwest, Least Cost, Vogels Approximation, or Modi Method. Hungarian MethodAssignment methods can’t be used
Method
Transportation methods can be used to solve assignment problems. to solve transportation problems.
Supply Chain Optimization, Distribution Network Design, Traffic Job Scheduling Personnel, Assignment Facility
Real-World Application
Flow Optimization Location, Machine Allocation
What are the Key Differences and Similarities Between Transportation and
Assignment Problems?
• Transportation problem deals with the optimal distribution of goods or
resources from multiple sources to multiple destinations, whereas
assignment problem deals with allocating tasks, jobs, or resources one-
to-one.
• Assignment Problem is a special type of transportation problem.
• Both transport and assignment problems are Linear Programming
Problems.
• Both are minimization problems having an objective function and structural
and non-negative constraints.
• The relationship between variable and constraints are linear.
Steps
• First check whether the number of rows is equal to a number of
columns, if it is so, the assignment problem is said to be balanced.
Thenproceedtostep1.If it is not balanced, then it should be balanced
before applying the algorithm.
Step1:Subtractthesmallestcostelementofeachrowfromallthe the
elements in the row of the given cost matrix. See that each row
contains at least one zero.
• Step 2: Subtract the smallest cost element of each column from all
the elements in the column of the resulting cost matrix obtained by
step1 and make sure each column contains at least one zero.
• Step3: (Assigning the zeros)
• (a)Examine the rows successively until a row with exactly one unmarked
zero is found. Make an assignment to this single unmarked zero by
encircling it. Cross all other zeros in the column of this encircled zero, as
these will not be considered for any future assignment. Continue in this
way until all the rows have been examined.
• (b)Examine the columns successively until a column with exactly one
unmarked zero is found. Make an assignment to this single unmarked
zero by encircling it and cross any other zero in its row. Continue until all
the columns have been examined.
• Step 4:(Apply Optimal Test)
• (a)If each row and each column contain exactly one encircled zero,
then the current assignment is optimal.
• (b)If at least one row or column is without an assignment(i.e. if there
is at least one row or column without one encircled zero), then the
current assignment is not optimal.
• Go to step5. Subtract the smallest cost element of each column from
all the elements in the column of the resulting cost matrix obtained
by step1 and make sure each column contains at least one zero.
• Step5:
• Cover all the zeros by drawing a minimum number of straight lines as
follows: (a)Mark the rows that do not have assignments. (b)Mark the
columns(not already marked)that have zeros in marked rows. (c)Mark
the rows(not already marked)that have assignments in marked
columns. (d)Repeat(b)and(c) until no more marking is required.
(e)Draw lines through all unmarked rows and marked columns. If the
number of these lines is equal to the order of the matrix then it is an
optimum solution otherwise not.
• Step6:Determine the smallest cost element not covered by the
straight lines. Subtract this smallest cost element from all the
uncovered elements and add this to all those elements which are
lying in the intersection of these straight lines and do not change the
remaining elements which lie on the straight lines.
• Step7:Repeat steps(1)to(6),until an optimum assignment is obtained.
