Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
19 views

Assignment Algorithms

The document discusses the Assignment Problem, which involves assigning jobs to machines at the least possible total cost, and is a specific case of the Transportation Model. It outlines the mathematical formulation of the problem and provides an example involving the assignment of inspection areas to assembly lines at Ballston Electronics. The Hungarian Method is introduced as a solution technique, detailing steps to find optimal assignments and handle cases where feasible assignments are not immediately possible.

Uploaded by

Sundaramali Govindaswamy G
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
19 views

Assignment Algorithms

The document discusses the Assignment Problem, which involves assigning jobs to machines at the least possible total cost, and is a specific case of the Transportation Model. It outlines the mathematical formulation of the problem and provides an example involving the assignment of inspection areas to assembly lines at Ballston Electronics. The Hungarian Method is introduced as a solution technique, detailing steps to find optimal assignments and handle cases where feasible assignments are not immediately possible.

Uploaded by

Sundaramali Govindaswamy G
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 17

The Assignment Algorithm

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.
The Assignment Problem
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
The Assignment Problem Example
Ballston Electronics manufactures small electrical devices.
Products are manufactured on five different assembly lines
(1,2,3,4,5).
When manufacturing is finished, products are transported from
the assembly lines to one of the five different inspection areas
(A,B,C,D,E).
Transporting products from five assembly lines to five inspection
areas requires different times (in minutes)
15 13 14 17
11 12 15 13
13 12 10 11
15 17 14 16
The Assignment Problem Example

 Under current arrangement, assignment of inspection


areas to the assembly lines are 1 to A, 2 to B, 3 to C, 4 to
D, and 5 to E.
 This arrangement requires 10+7+12+17+19 = 65 man
minutes.
10 4 6 10 12 6 0 2 6 8

11 7 7 9 14 4 0 0 2 7

13 8 12 14 15 5 0 4 6 7

14 16 13 17 17 1 3 0 4 4

19 11 17 20 19 8 0 6 9 8

3 0 0 2 2 5 0 2 4 4

3 2 0 0 5 3 0 0 0 3

2 0 2 2 1 4 0 4 4 3

0 5 0 2 0 0 3 0 2 0

5 0 4 5 2 7 0 6 7 4
3 0 0 2 2 2 0 0 2 1

3 2 0 0 5 2 2 0 0 4

2 0 2 2 1 1 0 2 2 0

0 5 0 2 0 0 6 1 3 0

5 0 4 5 2 4 0 4 5 0

1 0 0 2 1 1 0 0 2 0
1 2 0 0 4 1 2 0 0 3
0 0 2 2 0 1 1 3 3 0
0 7 2 4 1 0 7 2 4 0
2 0 4 5 0 3 1 5 6 0
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 draw a minimum number of lines through some of the rows
and columns, Such that all zero values are crossed out.
Hungarian Method Example 2

The next step is to select the smallest uncrossed out


element. This element is subtracted from every
uncrossed out element and added to every
element at the intersection of two lines.
Hungarian Method Example 2
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 drwaing
lines one more time.
Actually, we should continue drawing lines until a feasible assignment is possible.

You might also like