Assignment model

PRESENTED BY
DESMOND IGHRAVWE (PHD)

1
 Contents
1. Definition of assignment problems
2. Applications of assignment models
3. Objectives of assignment model
4. Mathematical form of assignment model
5. Types of assignment problems
6. Methods to solve assignment problems
7. Examples

2
1. Definition of Assignment
Problem
Assignment model is a special application of Linear Programming Problem (LPP),
in which the main objective is to assign the work or task to a group of
individuals such that:

i. There is only one assignment.

ii. All the assignments should be done in such a way that the total cost is
minimized (or profit is maximized, incase of maximization).

3
1. Definition of Assignment
Problem
In assignment problem, the cost of performing each task by each individual is
known.

It is desired to find out the best assignments, such that overall cost of assigning
the work is minimized.

4
2. Applications of
assignment models
1. In assigning machines to factory orders.

2. In assigning sales/marketing people to sales territories.

3. In assigning lecturers to lectures.

4. In assigning accountants to clients.

5
3. Objectives of assignment
model
No worker has more than one job.

No job is allotted to more than one worker.

Total time taken to complete a job is minimum.

The work done is cost effective.

6
4. Mathematical form
Assignment problems are of the minimization type. So, our objective
function is to minimize the total cost.

Z = Total assignment cost

7
4. Mathematical form
Subjected to constraints
(i) For all jth task, only one ith resource is possible

(i = 1,2, 3, …, n)

8
4. Mathematical form
ii. For all ith resource, there is only one jth task possible

( j = 1,2, 3, …, m)

iii. Zero-one constraint

9
Complete mathematical
model
Subject to constraints
(i = 1,2, 3, …, n)
( j = 1,2, 3, …, m)

10
5. Types of assignment
problems
1. Balanced assignment problem

2. Unbalanced assignment problem

3. Maximization assignment problem

11
 6. Methods to solve
assignment problems
1. Enumeration method

2. Integer programming method

3. Transportation method

4. Hungarian method

12
6. Step for Hungarian
method

1. Row reduction

2. Column reduction

3. Crossing all zero by minimum number of horizontal or vertical lines

4. Check whether the number of lines is equal to the number of jobs

5. Assign the jobs

13
i. Balanced assignment
problems
Number of rows = Number of columns

Number of jobs = Number of machines

14
Example 1
Solve the following assignment problem using Hungarian method

Man 1 2 3 4
Job
1 12 30 21 15
2 18 33 9 31
3 44 25 24 21
4 23 30 28 14

15
Example 1
Step 1: Select the minimum value of each row and subtract from all
the elements of the corresponding row.
Man 1 2 3 4 Min value
Job
1 12 30 21 15 12
2 18 33 9 31 9
3 44 25 24 21 21
4 23 30 28 14 14

16
 Example 1
Sample New table
Row Min New Man 1 2 3 4
1 value value Job
12 12 0 1 0 18 9 3
30 12 18 2 9 24 0 22
21 12 9 3 23 4 3 0
15 12 3 4 9 16 14 0

17
Example 1
Step 2: Select the minimum value of each column and subtract
from all the elements of the corresponding column.
Man 1 2 3 4
Job
1 0 18 9 3
2 9 24 0 22
3 23 4 3 0
4 9 16 14 0

Min value 0 4 0 0

18
 Example 1
Sample New table
Colu Min New Man 1 2 3 4
mn 2 value value Job
18 4 14 1 0 14 9 3
24 4 20 2 9 20 0 22
4 4 0 3 23 0 3 0
16 4 12 4 9 12 14 0

19
 Example 1
Step 3: Crossing all zero by minimum number of horizontal or vertical lines

Man 1 2 3 4
Job
1 0 14 9 3
2 9 20 0 22
3 23 0 3 0
4 9 12 14 0

20
Example 1
Step 4: Check whether the number of lines is equal to the number of jobs

Man 1 2 3 4
Job
1 0 14 9 3
2 9 20 0 22
3 23 0 3 0
4 9 12 14 0

21
 Example 1
Step 5: Assign jobs
Man 1 2 3 4 Job Man
Job
1 0 14 9 3 1 1
2 9 20 0 22 2 3
3 23 0 3 0 3 2
4 9 12 14 0 4 4

22
Total assignment cost
Job Cost (N)
1 12
2 9
3 25
4 14
Total cost 60

23
Example 2
Solve the following assignment problem using Hungarian method

Person Project
1 2 3
1 11 14 6
2 8 10 11
3 9 12 7

24
Example 2
Step 1: Select the minimum value of each row and subtract from all the
elements of the corresponding row.
Person Project
1 2 3 Min value

1 11 14 6 6
2 8 10 11 8
3 9 12 7 7

25
Example 2
Person Project
1 2 3
1 5 8 0
2 0 2 3
3 2 5 0

26
Example 2
Step 2: Select the minimum value of each column and subtract from all the elements of the corresponding
column.

Person Project
1 2 3
1 5 8 0
2 0 2 3
3 2 5 0
Min value 0 2 0

27
Example 2
Person Project
1 2 3
1 5 6 0
2 0 0 3
3 2 3 0

28
Example 2
Step 3: Crossing all zero by minimum number of horizontal or vertical lines

Person Project
1 2 3
1 5 6 0
2 0 0 3
3 2 3 0

29
Example 2
Step 4: Check whether the number of lines is equal to the number of jobs
Person Project
1 2 3
1 5 6 0
2 0 0 3 Covering line 1

3 2 3 0
Covering line 2

30
 Example 2
Since the number of lines is NOT EQUAL to the number of jobs, the solution is not optimal.

Person Project
1 2 3
1 5 6 0
2 0 0 3 Covering line 1

3 2 3 0
Covering line 2

31
Example 2
• Next, we subtract the smallest number not covered by a line
from all number not covered by a straight line.

• The same number is added to every number lying at the

32
Example 2
The smallest uncovered values is 2
Person Project
1 2 3
1 3 4 0
2 0 0 5
3 0 1 0

33
Example 2
The smallest uncovered values is 2
Person Project
1 2 3
1 3 4 0
2 0 0 5 Covering line 1

3 0 1 0
Covering line 2 Covering line 3

34
Example 2
Since the number of lines = number of jobs, the solution is optimal
Person Project
1 2 3
1 3 4 0
2 0 0 5 Covering line 1

3 0 2 0
Covering line 2 Covering line 3

35
Example 2
Step 5: Assign jobs

Person Project
Person Project
1 2 3
1 3 4 0 1 3
2 0 0 5 2 2
3 0 2 0 3 1

36
Total transportation cost
Person Cost (N)
1 6
2 10
3 9
Total 25

37
ii. Unbalanced assignment
problems
Number of rows Number of columns

Number of jobs Number of machines

38
ii. Unbalanced assignment
problems
 If the number of persons or objects to be assigned does not equal to the

number of tasks or clients or the machines listed in the columns is called

unbalanced assignment problem.

 When this occurs, and the are more rows than column, add a dummy column.

39
ii. Unbalanced assignment
problems
 If the number of tasks exceeds the number of people available, add a dummy

row.

 Since the dummy task or person is non-existent, we enter zeros in its row or

column as cost or time estimate.

40
Example 3
Person Project
1 2 3
1 11 14 6
2 8 10 11
3 9 12 7
4 10 13 9

41
Example 3
Person Project
1 2 3 Dummy
1 11 14 6 0
2 8 10 11 0
3 9 12 7 0
4 10 13 9 0

42
iii. Maximization Assignment
Problems
 Some assignment problems are phrased in terms of maximizing the

pay off or effectiveness.

 It is easy to obtain an equivalent minimization problem by

converting all the numbers in the table to opportunity costs.

43
iii. Maximization Assignment
Problems
 This is brought about by subtracting every numbers in the original pay off

table from the largest single number in the table.

 Transformed entries represent opportunity costs.

 Once the optimal assignment has been found, the total pay off of those cells

that are in the optimal assignment.

44
Efficiencies of ships in petrol
sectors
Ship Sector
1 2 3 4
1 20 60 50 55
2 60 30 80 75
3 80 100 90 80
4 65 80 75 70

The maximise value is 100

45
Opportunity costs of the patrol
sector
Ship Sector
Column 1 2 3 4
100-20 = 80 1 80 40 50 45
100-60= 40 2 40 70 20 25
100-80 = 20 3 20 0 10 20
100-65 = 35 4 35 20 25 30

46
Total efficiency
Assignment Efficiency
Ship 1 to Sector 4 55
Ship 2 to Sector 3 80
Ship 3 to Sector 2 100
Ship 4 to Sector 1 65
Total efficiency 300

47
Assignment 4
Solve the following minimal assignment problem using Hungarian
method
Man 1 2 3 4
Job
1 2 3 4 5
2 4 5 6 7
3 7 8 9 8
4 3 5 8 4

48
THANK YOU
FOR
LISTENING

49