Scribd
Upload
110 views11 pages

The Assignment Problem

The document describes the assignment problem, which aims to assign jobs to machines at the lowest total cost. It involves assigning n jobs to n machines, where assigning job i to machine j incurs a cost of Cij. The Hungarian method is presented as an algorithm to solve this problem through iterative steps of selecting minimum values, subtracting from rows/columns, and assigning based on zeros until a feasible solution is reached.

Uploaded by

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

The Assignment Problem

The document describes the assignment problem, which aims to assign jobs to machines at the lowest total cost. It involves assigning n jobs to n machines, where assigning job i to machine j incurs a cost of Cij. The Hungarian method is presented as an algorithm to solve this problem through iterative steps of selecting minimum values, subtracting from rows/columns, and assigning based on zeros until a feasible solution is reached.

Uploaded by

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

The Assignment Problem

The Assignment Problem

• In many business situations, management needs to assign -


personnel to jobs, - jobs to machines, - machines to job
locations, or - salespersons to territories.
• Consider the situation of assigning n jobs to n machines.
• When a job i (=1,2,....,n) is assigned to machine j (=1,2, .....n)
that incurs a cost Cij.
• The objective is to assign the jobs to machines at the least
possible total cost.
• This situation is a special case of the Transportation Model
and it is known as the assignment problem.
• Here, jobs represent “sources” and machines represent
“destinations.”
• The supply available at each source is 1 unit and demand at
each destination is 1 unit.
The Assignment Problem

The assignment model can be expressed


mathematically as follows:
Xij= 0, if the job j is not assigned to machine i
1, if the job j is assigned to machine i
The Assignment Problem
Hungarian Method Example

Step 1: Select the smallest value in each row.


Subtract this value from each value in that row

Step 2: Do the same for the columns that do not


have any zero value.
Hungarian Method Example

If not finished, continue


with other columns.
Hungarian Method Example

Step 3: Assignments are made at zero values.


• Therefore, we assign job 1 to machine 1; job 2 to
machine 3, and job 3 to machine 2.
• Total cost is 5+12+13 = 30.
• It is not always possible to obtain a feasible
assignment as in here.
Hungarian Method Example 2
Hungarian Method Example 2
• A feasible assignment is not possible at this moment.
• In such a case, the procedure is to
• Step 4: Draw a minimum number of lines through some of
the rows and columns, such that all zero values are covered.
• You can do the same intuitively, however, there are also steps exists
to cover all zeros
• Mark tick in the unassigned row(s)
• Mark tick in the column(s) if there is a zero in the ticked row(s)
• If there is assignment in the ticked column, tick that row
Hungarian Method Example 2

Step 5: Select the smallest uncovered element.This element is


subtracted from every uncovered element and added to every
element at the intersection of two lines.
Hungarian Method Example 2

• Step 6: We can now easily assign to the zero values.


• Solution is to assign (1 to 1), (2 to 3), (3 to 2) and (4 to 4).
• If drawing lines do not provide an easy solution, then we
should perform the task of drawing lines one more time.
(Repeat step 4)
• Actually, we should continue drawing lines until a feasible
assignment is possible (i.e. all the rows and columns have one
assignment)

You might also like