Scribd
Upload
21 views

Assignment Problem: Manoj Singh Dhaval Solanki Ronak Soni Rajan Karia Jackson

The document describes the assignment problem and the Hungarian method used to solve it. The assignment problem involves assigning jobs to operators in an optimal way to minimize costs. The Hungarian method is a algorithm developed in 1955 by Harold Kuhn to solve this problem in two phases - row and column reductions followed by solution optimization. Several examples of balanced and unbalanced, minimization and maximization assignment problems are provided along with the steps to solve them using the Hungarian method.

Uploaded by

m_474
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
21 views

Assignment Problem: Manoj Singh Dhaval Solanki Ronak Soni Rajan Karia Jackson

The document describes the assignment problem and the Hungarian method used to solve it. The assignment problem involves assigning jobs to operators in an optimal way to minimize costs. The Hungarian method is a algorithm developed in 1955 by Harold Kuhn to solve this problem in two phases - row and column reductions followed by solution optimization. Several examples of balanced and unbalanced, minimization and maximization assignment problems are provided along with the steps to solve them using the Hungarian method.

Uploaded by

m_474
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

ASSIGNMENT PROBLEM

Manoj Singh
Dhaval
Solanki
Ronak Soni
Rajan Karia
Based on the fundamental :
optimal object from finite set of objects
in the branch of optimization or operation
research

To solve this problem HUNGARIAN METHOD


is used.
Hungarian Method
D E V E L O P E D IN

1955
BY

Harold Kuhn
Types of Assignment
Problem

Balanced

Unbalanced
There could be..

Minimization

Maximization
First phase:
Row reductions
column reductions

TWO
Second phase :
Solution Phases
optimization
Example of Assignment Problem
ROW entity COLOUM CELL entity
entity
Jobs Operators Processing time

Programmer Program Processing time

Operators Machine Processing time

Drivers Routes Travel time

Teachers Subjects Student


percentage
Minimization
Simple Balanced Job Assignment

OPERATOR
JOB 1 2 3

1 40
130 10
110 0
90
90

2 0x
900 100
00 120
30
30
3
120
120
0 150
Total
20 Cost =130
210
10
Lets see another example….

OPERATOR
JOB
1 2 3 4 5

1 12 6 14 16 18
2 4 10 20 14 7
3 12 9 3 3 3
4 8 11 9 9 13
5 6 8 9 11 5
No of line != No of row & column
Values after row&column reduction
OPERATOR 1 2 3 4 5
JOB

1 6 0 8 10 12
2 0 6 16 10 3
3 9 6 0 0 0
4 0 3 1 1 5
5 1 3 4 6 0
No of line = No of row & column

OPERATOR 1 2 3 4 5
JOB

1 7 0 8 10 12
2 0 5 15 9 2
3 10 6 0 0 0
4 0 2 0 0 4
5 2 3 4 6 0
No of line = No of row & column

OPERATOR 1 2 3 4 5
JOB

1 7 0 8 10 12
2 0 5 15 9 2
3 10 6 0 0x x0
4 0x 2 x0 0 4
5 2 3 4 6 0
No of line = No of row & column

OPERATOR 1 2 3 4 5
JOB

1 6
2 4
3 3
4 9
5 Total Cost = 27 5
Unbalanced
Balanced

OPERATOR
JOB 1 2 3 4 5

1 12 6 M
- 16 18
2 4 10 20 14 7
3 M
- 9 3 3 3
4 8 11 9 9 13
0 0 0 0 0
Than follow the same steps as
discussed below..

- Do Row & Column reduction

- Draw a straight line

- Do Allocation

- Make Total of value


Maximization
OPERATOR
JOB
1 2 3 4 5

1 75 80 85 70 90
2 91 71 82 75 85
3 78 90 85 80 80
4 65 75 88 85 90
5 77 85 78 72 88
You will get a new matrix
OPERATOR
JOB
1 2 3 4 5

1 16 11 6 21 1
2 0 20 9 16 6
3 13 1 6 11 11
4 26 16 3 6 1
5 14 6 13 19 3
Than follow the same steps as
discussed below..

- Do Row & Column reduction

- Draw a straight line

- Do Allocation

- Make Total of value

You might also like