Scribd
Upload
6 views

Assignmet Problem

Uploaded by

sadiasaeda4
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
6 views

Assignmet Problem

Uploaded by

sadiasaeda4
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/ 5

Assignment Problem

Assignment PROBLEM is special type of Transportation


where supply and demand are 1units each. Assignment
problem occurs when the manager in the organization
wants to assign n objects to m facilities on a one to one
basis. E.g. Assigning workers to tasks, Assigning workers
to machines, Assigning workers to jobs. The fundamental
objective of making assignment is to minimize cost of
completing or carrying out an assignment or to maximize
profit from carrying out a task. The method used to solve
this kind of problem is called Hungarian method. It is
based on opportunity cost concept. Steps in Hungarian
method:
Steps in Hungarian method:

• 1) Identify the minimum cost element in each row and subtract


it from all elements in that row. This results in the first reduced
cost matrix. 2) Subtract the minimum element in each column
of then first reduced cost matrix from all elements in the
column. 3) Determine if an assignment with a total reduced
cost of zero is possible from the second reduced matrix. If so,
this assignment is optimal. If not proceed to step 4. 4) Draw a
minimum number of horizontal and/or vertical lines to cover
all zeros. If the minimum number of straight lines is the same
as the number of rows or equivalent columns in the matrix, an
optimal solution is reached. If not, subtract the smallest
element from not covered numbers by a line and add this same
element to all elements laying at the intersection of the two
lines. 5) Determine if an optimal assignment is possible. If not,
repeat step 4 and 5 until an optimal solution is reached.
Ex. Solve the following problem using assignment method.

Employees
Jobs A B C D Row
Minimum

1 15 20 18 24 15

2 12 17 16 15 12

3 14 15 19 17 14

4 11 14 12 13 11
Employees
Jobs A B C D Row Min.

1 0 5 3 9

2 0 5 4 3

3 0 1 5 3

4 0 3 1 2

Col. Min 0 1 1 2

You might also like