OPERATION RESEARCH

ME354

OPERATION RESEARCH

Lecture -7

Assignment Problems
NITK , Surathkal
OPERATION RESEARCH
Course plan
Topics to be covered Hrs
Introduction 2
Formulation of LPP 3
Solutions of LPP Graphical solution 9
Simplex Methods
Big M
Transportation Travelling Salesman Problems 6
Problems
Assignment Problems 6
PERT and CPM Total, Free and Independent Float, Network Crashing 6
Job Sequencing 4
Game Theory 4
Queuing Theory Waiting Line Theory 4

NITK , Surathkal
OPERATION RESEARCH
Assignment Problems
➢ Introduction
➢ Assumptions
➢ Classification
➢ Various Steps involved in Hungarian method
➢ Example 1 (Minimization problem)
➢ Example 2 (Minimization problem)
➢ Example 3 (Diagonal rule)
➢ Example 4 (Maximization problem)
➢ Example 5 (unbalanced problem)
NITK , Surathkal
 Introduction
OPERATION RESEARCH

➢ The assignment problem is a special type of linear programming problem where

assignees are being assigned to perform tasks
➢ For example, the assignees might be employees who need to be given work
assignments.
➢ Assigning people to jobs is a common application of the assignment problem
➢ The assignees need not be people.
➢ They also could be machines, or vehicles, or plants, or even time slots to be
assigned tasks.
NITK , Surathkal
OPERATION RESEARCH
Introduction contd..
For an assignment problem, these kinds of applications need to be formulated in a
way that satisfies the following assumptions
1. The number of assignees and the number of tasks are the same
2. Each assignee is to be assigned to exactly one task.
3. Each task is to be performed by exactly one assignee
4. There is a cost cij associated with assignee i (i = 1, 2, . . . , n)
performing task j ( j = 1, 2, . . . , n).
5. The objective is to determine how all n assignments should be made to
minimize the total cost. NITK , Surathkal
OPERATION RESEARCH
Assignment Problems

Types of Assignment Problems

I. Balanced Assignment Problems
II. Unbalanced Assignment Problems

HUNGARIAN METHOD
Phase I- (Row and column reduction)
Phase II- Optimization of the problem
NITK , Surathkal
OPERATION RESEARCH HUNGARIAN METHOD
Phase I- (Row and column reduction)

1. Subtract the minimum value of each row from the entries of that row

2. Subtract the minimum value of each column from the entries of that column

Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix

a. Row scanning

i. Start from the first row , check for exactly one zero in that row. If yes Mark a Square around the zero entity and
draw a vertical line passing through the zero else skip the row.

ii. After scanning, check whether all the Zero are covered with lines, If yes go to step 2 else do column scanning

a. Column Scanning

i. Start from the first column , check for exactly one zero in that column. If yes Mark a Square around the zero
entity and draw a horizontal line passing through the zero else skip the column.
NITK , Surathkal
ii. After scanning, check whether all the Zero are covered with lines
OPERATION RESEARCH HUNGARIAN METHOD
Phase II- Optimization of the problem

Step 2 : Check whether the no of Squares marked is equal to no of rows of the matrix . If yes go to step 5 else
go to step 3.

Step 3 : Identify the minimum value of the undeleted cell values

i. Add the minimum undeleted cell value at all the intersection points of the present matrix.

ii. Subtract the minimum undeleted cell value from the all the undeleted cell values.

iii.All other entries remain same.

Step 4 : Go with step 1

Step 5 : Optimality is reached

NITK , Surathkal
OPERATION RESEARCH HUNGARIAN METHOD-Example 1

We must determine how jobs should be assigned to machines to minimize

setup times, which are given below:

Job 1 Job 2 Job 3 Job 4

Machine 1 5 9 3 8

Machine 2 8 7 8 2
Machine 3 6 10 12 7
Machine 4 3 10 8 6

NITK , Surathkal
OPERATION RESEARCH Phase I- (Row and column reduction)

Phase 1-Step I row reduction- Minimum value in the row

Job 1 Job 2 Job 3 Job 4

Machine 1 5 9 3 8
Machine 2 8 7 8 2
Machine 3 6 10 12 7
Machine 4 3 10 8 6

Job 1 Job 2 Job 3 Job 4

Machine 1 2 6 0 5
Machine 2 6 5 6 0
Machine 3 0 4 6 1
NITK , Surathkal
Machine 4 0 7 5 3
OPERATION RESEARCH Phase I- (Row and column reduction)

Phase 1-Step II column reduction- Minimum value in the column

Job 1 Job 2 Job 3 Job 4

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

Job 1 Job 2 Job 3 Job 4

Machine 1 2 2 0 5
Machine 2 6 1 6 0
Machine 3 0 0 6 1
NITK , Surathkal
Machine 4 0 3 5 3
OPERATION RESEARCH
Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix
a. Row scanning
Job 1 Job 2 Job 3 Job 4
Machine 1 2 2 0 5
Machine 2 6 1 6 0
Machine 3 0 0 6 1
Machine 4 0 3 5 3

i. Start from the first row , check for exactly one zero in that row. If yes Mark a Square around the zero
entity and draw a vertical line passing through the zero else skip the row.

ii. After scanning, check whether all the Zero are covered with lines, If yes go to step 2 else do column
scanning
NITK , Surathkal
OPERATION RESEARCH Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix
b. Column scanning

Job 1 Job 2 Job 3 Job 4

Machine 1 2 2 0 5
Machine 2 6 1 6 0
Machine 3 0 0 6 1
Machine 4 0 3 5 3

i. Start from the first column , check for exactly one zero in that column. If yes Mark a Square around the
zero entity and draw a horizontal line passing through the zero else skip the column.

ii. After scanning, check whether all the Zero are covered with lines
NITK , Surathkal
iii. Go to step 2
OPERATION RESEARCH Phase II- Optimization of the problem

Step 2 : Check whether the no of Squares marked is equal to no of rows of the matrix .
If yes go to step 5 else go to step 3.

Job 1 Job 2 Job 3 Job 4

Machine 1 2 2 0 5
Machine 2 6 1 6 0
Machine 3 0 0 6 1
Machine 4 0 3 5 3

i. No of Square Marks = 4

ii. No of rows =4

Step 5 : Optimality is reached NITK , Surathkal

OPERATION RESEARCH HUNGARIAN METHOD-Example 2

Solve using Hungarian method. The matrix entries represent the processing times in hours

Op1 Op2 Op3 Op4 Op5

J1 10 12 15 12 8
J2 7 16 14 14 11
J3 13 14 7 9 9
J4 12 10 11 13 10
J5 8 13 15 11 15

NITK , Surathkal
OPERATION RESEARCH Phase I- (Row and column reduction)

Phase 1-Step I row reduction- Minimum value in the row

Op1 Op2 Op3 Op4 Op5

J1 10 12 15 12 8
J2 7 16 14 14 11
J3 13 14 7 9 9
J4 12 10 11 13 10
J5 8 13 15 11 15

Op1 Op2 Op3 Op4 Op5

J1 2 4 7 4 0
J2 0 9 7 7 4
J3 6 7 0 2 2
J4 2 0 1 3 0
NITK , Surathkal
J5 0 5 7 3 7
OPERATION RESEARCH Phase I- (Row and column reduction)

Phase 1-Step II column reduction- Minimum value in the column

Op1 Op2 Op3 Op4 Op5

J1 2 4 7 4 0
J2 0 9 7 7 4
J3 6 7 0 2 2
J4 2 0 1 3 0
J5 0 5 7 3 7

Op1 Op2 Op3 Op4 Op5

J1 2 4 7 2 0
J2 0 9 7 5 4
J3 6 7 0 0 2
J4 2 0 1 1 0
NITK , Surathkal
J5 0 5 7 1 7
OPERATION RESEARCH Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix

a. Row scanning

Op1 Op2 Op3 Op4 Op5

J1 2 4 7 2 0
J2 0 9 7 5 4
J3 6 7 0 0 2
J4 2 0 1 1 0
J5 0 5 7 1 7

i. Start from the first row , check for exactly one zero in that row. If yes Mark a Square around the zero
entity and draw a vertical line passing through the zero else skip the row.

ii. After scanning, check whether all the Zero are covered with lines, If yes go to step 2 else do column
scanning
NITK , Surathkal
OPERATION RESEARCH Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix

b. Column scanning

Op1 Op2 Op3 Op4 Op5

J1 2 4 7 2 0
J2 0 9 7 5 4
J3 6 7 0 0 2
J4 2 0 1 1 0
J5 0 5 7 1 7

i. Start from the first column , check for exactly one zero in that column. If yes Mark a Square around the
zero entity and draw a horizontal line passing through the zero else skip the column.

ii. After scanning, check whether all the Zero are covered with lines
NITK , Surathkal
iii. Go to step 2
OPERATION RESEARCH Phase II- Optimization of the problem

Step 2 : Check whether the no of Squares marked is equal to no of rows of the matrix .
If yes go to step 5 else go to step 3.
Op1 Op2 Op3 Op4 Op5
i. No of Square Marks = 4
J1 2 4 7 2 0
ii. No of rows =5
J2 0 9 7 5 4
Step 5 : Optimality not reached J3 6 7 0 0 2
J4 2 0 1 1 0
J5 0 5 7 1 7

Go to step 3 NITK , Surathkal

OPERATION RESEARCH Phase II- Optimization of the problem

Step 3 : Identify the minimum value of the undeleted cell values

i. Add the minimum undeleted cell value at all the

intersection points of the present matrix.
Op1 Op2 Op3 Op4 Op5
ii. Subtract the minimum undeleted cell value from the all
J1 2 4 7 2 0
the undeleted cell values.
J2 0 9 7 5 4
iii.All other entries remain same.
J3 6 7 0 0 2

Op1 Op2 Op3 Op4 Op5 J4 2 0 1 1 0

J5 0 5 7 1 7
J1 2 4 6 1 0
J2 0 9 6 4 4
J3 7 8 0 0 3
J4 2 0 0 0 0
NITK , Surathkal
J5 0 5 6 0 7 Step 4 : Go with step 1
OPERATION RESEARCH Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix

a. Row scanning
Op1 Op2 Op3 Op4 Op5

J1 2 4 6 1 0
J2 0 9 6 4 4
J3 7 8 0 0 3
J4 2 0 0 0 0
J5 0 5 6 0 7

i. Start from the first row , check for exactly one zero in that row. If yes Mark a Square around the zero
entity and draw a vertical line passing through the zero else skip the row.

ii. After scanning, check whether all the Zero are covered with lines, If yes go to step 2 else do column
scanning
NITK , Surathkal
OPERATION RESEARCH Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix

b. Column scanning
Op1 Op2 Op3 Op4 Op5

J1 2 4 6 1 0
J2 0 9 6 4 4
J3 7 8 0 0 3
J4 2 0 0 0 0
J5 0 5 6 0 7

i. Start from the first column , check for exactly one zero in that column. If yes Mark a Square around the
zero entity and draw a horizontal line passing through the zero else skip the column.

ii. After scanning, check whether all the Zero are covered with lines

iii. Go to step 2
NITK , Surathkal
OPERATION RESEARCH Phase II- Optimization of the problem

Step 2 : Check whether the no of Squares marked is equal to no of rows of the matrix .
If yes go to step 5 else go to step 3.
i. No of Square Marks = 5 Op1 Op2 Op3 Op4 Op5

ii. No of rows =5 J1 2 4 6 1 0
J2 0 9 6 4 4
Step 5 : Optimality reached J3 7 8 0 0 3

J1 Op5 8 J4 2 0 0 0 0

J2 Op1 7 J5 0 5 6 0 7
J3 Op3 7
J4 Op2 10
J5 Op4 11
Total hrs. 43 NITK , Surathkal
OPERATION RESEARCH HUNGARIAN METHOD-Example 3
DIAGONAL RULE

Solve the following assignment problem using Hungarian method

Op A Op B Op C Op D

JOB 1 5 3 2 8

JOB 2 7 9 2 6
JOB 3 6 4 5 7
JOB 4 5 7 7 8

NITK , Surathkal
OPERATION RESEARCH Phase I- (Row and column reduction)

Phase 1-Step I row reduction- Minimum value in the row

Op A Op B Op C Op D

JOB 1 5 3 2 8
JOB 2 7 9 2 6
JOB 3 6 4 5 7
JOB 4 5 7 7 8

Op A Op B Op C Op D

JOB 1 3 1 0 6
JOB 2 5 7 0 4
JOB 3 2 0 1 3
NITK , Surathkal
JOB 4 0 2 2 3
OPERATION RESEARCH Phase I- (Row and column reduction)

Phase 1-Step II column reduction- Minimum value in the column

Op A Op B Op C Op D

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

Op A Op B Op C Op D

JOB 1 3 1 0 3
JOB 2 5 7 0 1
JOB 3 2 0 1 0
NITK , Surathkal
JOB 4 0 2 2 0
OPERATION RESEARCH
Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix
a. Row scanning
Op A Op B Op C Op D

JOB 1 3 1 0 3
JOB 2 5 7 0 1
JOB 3 2 0 1 0
JOB 4 0 2 2 0
i. Start from the first row , check for exactly one zero in that row. If yes Mark a Square around the zero
entity and draw a vertical line passing through the zero else skip the row.

ii. After scanning, check whether all the Zero are covered with lines, If yes go to step 2 else do column
scanning
NITK , Surathkal
OPERATION RESEARCH Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix
b. Column scanning

Op A Op B Op C Op D

JOB 1 3 1 0 3
JOB 2 5 7 0 1
JOB 3 2 0 1 0
JOB 4 0 2 2 0

i. Start from the first column , check for exactly one zero in that column. If yes Mark a Square around the
zero entity and draw a horizontal line passing through the zero else skip the column.

ii. After scanning, check whether all the Zero are covered with lines
NITK , Surathkal
iii. Go to step 2
OPERATION RESEARCH Phase II- Optimization of the problem

Step 2 : Check whether the no of Squares marked is equal to no of rows of the matrix .
If yes go to step 5 else go to step 3.
Op A Op B Op C Op D
i. No of Square Marks = 3

ii. No of rows =4 JOB 1 3 1 0 3

Step 5 : Optimality not reached JOB 2 5 7 0 1
JOB 3 2 0 1 0
JOB 4 0 2 2 0

Go to step 3

NITK , Surathkal
OPERATION RESEARCH Phase II- Optimization of the problem

Step 3 : Identify the minimum value of the undeleted cell values

i. Add the minimum undeleted cell value at all the

intersection points of the present matrix. (Addition) Op A Op B Op C Op D

ii. Subtract the minimum undeleted cell value from the all JOB 1 3 1 0 3
the undeleted cell values. (Subtraction) JOB 2 5 7 0 1
iii.All other entries remain same. (copy) JOB 3 2 0 1 0
JOB 4 0 2 2 0
Op A Op B Op C Op D

JOB 1 2 0 0 2
JOB 2 4 6 0 0
JOB 3 2 0 2 0
JOB 4 0 2 3 0 Step 4 : Go with step 1
NITK , Surathkal
OPERATION RESEARCH Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix

a. Row scanning

Op A Op B Op C Op D

JOB 1 2 0 0 2
JOB 2 4 6 0 0
JOB 3 2 0 2 0
JOB 4 0 2 3 0

i. Start from the first row , check for exactly one zero in that row. If yes Mark a Square around the zero
entity and draw a vertical line passing through the zero else skip the row.

ii. After scanning, check whether all the Zero are covered with lines, If yes go to step 2 else do column
scanning
NITK , Surathkal
OPERATION RESEARCH Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix

b. Column scanning

Op A Op B Op C Op D

JOB 1 2 0 0 2
JOB 2 4 6 0 0
JOB 3 2 0 2 0
JOB 4 0 2 3 0

i. Start from the first column , check for exactly one zero in that column. If yes Mark a Square around the
zero entity and draw a horizontal line passing through the zero else skip the column.

ii. After scanning, check whether all the Zero are covered with lines

iii. Yes - Go to step 2

NITK , Surathkal
iv. No – apply the diagonal rule
OPERATION RESEARCH DIAGONAL RULE

Op A Op B Op C Op D

JOB 1 2 0 0 2
JOB 2 4 6 0 0
JOB 3 2 0 2 0
JOB 4 0 2 3 0

i. Select the Zero diagonally opposite to each other.

ii. After scanning, check whether all the Zero are covered with lines

iii. Yes-Go to step 2

NITK , Surathkal
OPERATION RESEARCH Phase II- Optimization of the problem

Step 2 : Check whether the no of Squares marked is equal to no of rows of the matrix .
If yes go to step 5 else go to step 3.
i. No of Square Marks = 4 Op A Op B Op C Op D

ii. No of rows =4 JOB 1 2 0 0 2

JOB 2 4 6 0 0
Step 5 : Optimality reached
JOB 3 2 0 2 0
J1 Op B 3
JOB 4 0 2 3 0
J2 Op C 2
J3 Op D 7
J4 Op A 5
Total hrs. 17
NITK , Surathkal
OPERATION RESEARCH HUNGARIAN METHOD- Maximization Problem

Solve the following assignment problem to Maximize the sales

Tr A Tr B Tr C Tr D

Salesman 1 45 38 30 22

Salesman 2 35 29 20 14
Salesman3 35 29 20 14
Salesman 4 27 20 15 10

NITK , Surathkal
OPERATION RESEARCH HUNGARIAN METHOD- Maximization Problem

Tr A Tr B Tr C Tr D

Salesman 1 45 38 30 22

Salesman 2 35 29 20 14
Salesman3 35 29 20 14
Salesman 4 27 20 15 10

i. Convert it into a minimization problem by subtracting all the elements from the largest
element in the matrix

NITK , Surathkal
OPERATION RESEARCH HUNGARIAN METHOD- Maximization Problem

Tr A Tr B Tr C Tr D

Salesman 1 45 38 30 22

Salesman 2 35 29 20 14
Salesman3 35 29 20 14
Salesman 4 27 20 15 10

Tr A Tr B Tr C Tr D

Salesman 1 0 7 15 23

Salesman 2 10 16 25 31
Salesman3 10 16 25 31
NITK , Surathkal
Salesman 4 18 25 30 35
OPERATION RESEARCH Phase I- (Row and column reduction)

Phase 1-Step I row reduction- Minimum value in the row

Tr A Tr B Tr C Tr D

Salesman 1 0 7 15 23

Salesman 2 10 16 25 31
Salesman3 10 16 25 31
Salesman 4 18 25 30 35

Tr A Tr B Tr C Tr D

Salesman 1 0 7 15 23

Salesman 2 0 6 15 21
Salesman3 0 6 15 21
NITK , Surathkal
Salesman 4 0 7 12 17
OPERATION RESEARCH Phase I- (Row and column reduction)
Phase 1-Step II column reduction- Minimum value in the column
Tr A Tr B Tr C Tr D

Salesman 1 0 7 15 23

Salesman 2 0 6 15 21
Salesman3 0 6 15 21
Salesman 4 0 7 12 17

Tr A Tr B Tr C Tr D

Salesman 1 0 1 3 6

Salesman 2 0 0 3 4
Salesman3 0 0 3 4
NITK , Surathkal
Salesman 4 0 1 0 0
OPERATION RESEARCH Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix

a. Row scanning

Tr A Tr B Tr C Tr D

Salesman 1 0 1 3 6

Salesman 2 0 0 3 4
Salesman3 0 0 3 4
Salesman 4 0 1 0 0

i. Start from the first row , check for exactly one zero in that row. If yes Mark a Square around the zero
entity and draw a vertical line passing through the zero else skip the row.

ii. After scanning, check whether all the Zero are covered with lines, If yes go to step 2 else do column
scanning
NITK , Surathkal
OPERATION RESEARCH Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix

b. Column scanning

Tr A Tr B Tr C Tr D

Salesman 1 0 1 3 6

Salesman 2 0 0 3 4
Salesman3 0 0 3 4
Salesman 4 0 1 0 0

i. Start from the first column , check for exactly one zero in that column. If yes Mark a Square around the
zero entity and draw a horizontal line passing through the zero else skip the column.

ii. After scanning, check whether all the Zero are covered with lines
NITK , Surathkal
iii. Go to step 2
OPERATION RESEARCH Phase II- Optimization of the problem

Step 2 : Check whether the no of Squares marked is equal to no of rows of the matrix .
If yes go to step 5 else go to step 3.

i. No of Square Marks = 3
Tr A Tr B Tr C Tr D
ii. No of rows =4
Salesman 1 0 1 3 6
Step 5 : Optimality not reached
Salesman 2 0 0 3 4
Salesman3 0 0 3 4
Salesman 4 0 1 0 0

Go to step 3 NITK , Surathkal

OPERATION RESEARCH Phase II- Optimization of the problem

Step 3 : Identify the minimum value of the undeleted cell values

i. Add the minimum undeleted cell value at all the intersection points of the present matrix. (Addition)
ii. Subtract the minimum undeleted cell value from the all the undeleted cell values. (Subtraction)

iii.All other entries remain same. (copy) Tr A Tr B Tr C Tr D

Salesman 1 0 1 3 6

Salesman 2 0 0 3 4
Salesman3 0 0 3 4
Tr A Tr B Tr C Tr D
Salesman 4 0 1 0 0
Salesman 1 0 1 0 3

Salesman 2 0 0 0 1
Salesman3 0 0 0 1
NITK , Surathkal
Salesman 4 3 4 0 0 Step 4 : Go with step 1
OPERATION RESEARCH Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix

a. Row scanning

Tr A Tr B Tr C Tr D

Salesman 1 0 1 0 3

Salesman 2 0 0 0 1
Salesman3 0 0 0 1
Salesman 4 3 4 0 0

i. Start from the first row , check for exactly one zero in that row. If yes Mark a Square around the zero
entity and draw a vertical line passing through the zero else skip the row.

ii. After scanning, check whether all the Zero are covered with lines, If yes go to step 2 else do column
scanning
NITK , Surathkal
OPERATION RESEARCH Phase II- Optimization of the problem

Step 1 : Draw minimum of lines to cover all the zeros of the matrix

b. Column scanning
Tr A Tr B Tr C Tr D

Salesman 1 0 1 0 3

Salesman 2 0 0 0 1
Salesman3 0 0 0 1
Salesman 4 3 4 0 0

i. Start from the first column , check for exactly one zero in that column. If yes Mark a Square around the
zero entity and draw a horizontal line passing through the zero else skip the column.

ii. After scanning, check whether all the Zero are covered with lines

iii. Yes - Go to step 2

NITK , Surathkal
iv. No – apply the diagonal rule
OPERATION RESEARCH DIAGONAL RULE

Tr A Tr B Tr C Tr D

Salesman 1 0 1 0 3

Salesman 2 0 0 0 1
Salesman3 0 0 0 1
Salesman 4 3 4 0 0

i. Select the Zero diagonally opposite to each other.

ii. After scanning, check whether all the Zero are covered with lines

iii. Yes-Go to step 2

NITK , Surathkal
OPERATION RESEARCH Phase II- Optimization of the problem

Step 2 : Check whether the no of Squares marked is equal to no of rows of the matrix .
If yes go to step 5 else go to step 3. Tr A Tr B Tr C Tr D

i. No of Square Marks = 4 Salesman 1 0 1 0 3

ii. No of rows =4 Salesman 2 0 0 0 1

Salesman3 0 0 0 1
Step 5 : Optimality reached
Salesman 4 3 4 0 0
S1 Tr A 45
S2 Tr B 29
Tr A Tr B Tr C Tr D
S3 Tr C 20
Salesman 1 45 38 30 22
S4 Tr D 10
Total hrs. 104
Salesman 2 35 29 20 14
Salesman3 35 29 20 14
NITK , Surathkal
Salesman 4 27 20 15 10
OPERATION RESEARCH
HUNGARIAN METHOD- Unbalanced Problem

Job 1 Job 2 Job 3

Machine 1 5 9 3

Machine 2 8 7 8
Machine 3 6 10 12
Machine 4 3 10 8

NITK , Surathkal
OPERATION RESEARCH

Thank you

NITK , Surathkal