Scribd
Upload
25 views

Assignment Problem

Problems

Uploaded by

Divyam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
25 views

Assignment Problem

Problems

Uploaded by

Divyam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 22

Assignment Problem

Introduction
Assignment problem is a particular class of transportation
linear programming problems
Supplies and demands will be integers (often 1)
Traveling salesman problem is a special type of
assignment problem
Let us know about structure and formulate a basic
assignment problem
We will demonstrate the formulation and solution with a
numerical example
Structure of Assignment Problem

Assignment problem is a special type of transportation


problem in which

Number of supply and demand nodes are equal.


Supply from every supply node is one.
Every demand node has a demand for one.
Solution is required to be all integers.
Structure of Assignment Problem …contd.
Goal of an general assignment problem:
 Find an optimal assignment of machines (laboures) to jobs
without assigning an agent more than once and ensuring
that all jobs are completed
The objective might be to minimize the total time to
complete a set of jobs, or to maximize skill ratings,
maximize the total satisfaction of the group or to minimize
the cost of the assignments
This is subjected to the following requirements:
Each machine is assigned no more than one job.
Each job is assigned to exactly one machine.
Formulation of Assignment Problem
Consider m laborers to whom n tasks are assigned
No Laborer can either sit ideal or do more than one task
Every pair of person and assigned work has a rating
Rating may be cost, satisfaction, penalty involved or time
taken to finish the job
N2 such combinations of persons and jobs assigned
Optimization problem: Find such job-man combinations
that optimize the sum of ratings among all.
Formulation of Assignment Problem …contd.

Representation of this problem as a special case of


transportation problem
laborer as sources
tasks as destinations
Supply available at each source is 1
Demand required at each destination is 1
Cost of assigning (transporting) laborer i to task j is cij.
It is necessary to first balance this problem by adding a
dummy laborer or task depending on whether m < n
or m > n, respectively
Cost coefficient cij for this dummy will be zero.
Formulation of Assignment Problem…
contd.
Let xij be the decision variable.
xij =0, if the jth job is not assign to the ith machine

1, if the jth job is assign to the ith machine

The objective function is


m n
Minimize   c x
ij ij
i 1 j 1

Since each task is assigned to exactly one laborer and each


laborer is assigned to only one job, the constraints are
Formulation of Assignment Problem…
contd.
m

x
i 1
ij 1
for j = 1, 2, …..n
n

x
j 1
ij  1 for i = 1, 2, …..m

Due to special structure of assignment problem,


the solution can be found out using a more convenient
method called Hungarian method.
Example (1)
Consider three jobs to be assigned to three machines. The
cost for each combination is shown in the table below.
Determine the minimal job –machine combinations
Example (1)…contd.
Solution:
Step 1:
Create zero elements in the cost matrix (zero assignment)
by subtracting the smallest element in each row (column)
from the corresponding row(column).
Considering the rows first, the resulting cost matrix is
obtained by subtracting 5 from row 1, 10 from row 2 and
13 from row 3 (Table 2)
Step 2:
Repeating the same with columns, the final cost matrix is
(Table 3)
1

The italized zero elements in Table 3 represent a feasible


solution
Thus the optimal assignment is (1,1), (2,3) and (3,2)
The total cost is equal to (5 +12+13) = 30
Example (2)
In the above example, it was possible to obtain the
feasible assignment
But in more complicate problems, additional rules are
required which are explained in the next example.
Example 2
Consider four jobs to be assigned to four machines.
Determine the minimal job –machine combinations.
The cost for each combination is shown in the table below
Example (2) …contd.
Solution:
Step 1: Create zero elements in the cost matrix by
subtracting the smallest element in each row from
the corresponding row.
Example (2) …contd.
Step 2: Repeating the same with columns, the final cost
matrix is
Example (2) …contd.
Rows 1 and 3 have only one zero element
Both of these are in column 1, which means that both jobs
1 and 3 should be assigned to machine 1
As one machine can be assigned with only one job, a
feasible assignment to the zero elements is not as in the
previous example

Step 3: Draw a minimum number of lines through some


of the rows and columns so that all the zeros are crossed
out
Example (2) …contd.
Step 4: Select the smallest uncrossed element (which is 1)

Subtract it from every uncrossed element and also add it


to every element at the intersection of the two lines.
This will give the following table
Example (2) …contd.
This gives a feasible assignment (1,1), (2,3), (3,2) and
(4,4)
And the total cost is 1+10+5+5 = 21.
If the optimal solution had not been obtained in the last
step, then the procedure of drawing lines has to be
repeated until a feasible solution is achieved.
Exercises
Solve the following assignment problem

1 2 3 4
A 10 12 19 11
B 5 10 7 8
C 12 14 13 11
D 8 15 11 9

Ans: A – 2, B – 3, C- 4, D-1, Min Z =38


Exercises
A department store wishes to stock the following
quantities of a popular product in three types of
containers:
Container type: 1 2 3
Quantity: 170 200 180
Tenders are submitted by four dealers who undertake the
supply not more than the quantities shown below:
Dealer: 1 2 3 4
Quantity: 150 160 110 130
Exercises
The store estimates that profit per unit will vary with dealer as
shown below:
Dealers 1 2 3 4
Conta-
iner type
1 8 9 6 3

2 6 11 5 10

3 3 8 7 9

Find the maximum profit of the store.


Ans: x12=40, x14=130, x22 = 90, x23 = 110, x31 = 150, x32= 30
 Max profit = 4710
THANK YOU

You might also like