Scribd
Upload
4 views

Assignment 1

Uploaded by

esportsonelife
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Assignment 1

Uploaded by

esportsonelife
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

ASSIGNMENT METHOD

SPECIAL CASE OF LPP


ASSIGNMENT PROBLEM
INTRODUCTION TO HAM
WHAT IS ASSIGNMENT METHOD?

USE OF HUNGARIAN ASSIGNMENT METHOD IS BASED ON THE CONCEPT OF


OPPORTUNITY COST

THE UNDERLYING PRINCIPLE BEING THAT IF A CONSTANT IS ADDED OR


SUBTRACTED FROM EVERY ELEMNET OF A COST TABLE, THE ORIGINAL
COST TABLE REMAINS THE SAME

ENTAILS A PROCESS OF CONVERTING THE ORIGINAL COST TABLE INTO


REDUCED COST TABLES

THIS IS DONE TILL AN OPTIMAL SOLUTION IS OBTAINED


A TYPICAL ASSIGNMENT PROBLEM
IT MAY BE IN THE FORM OF CERTAIN NUMBER OF PERSONS AND AN
EQUAL NUMBER OF JOBS
THE OBJECTIVE FUNCTION OF AN ASSIGNMENT PROBLEM IS OF THE
MINIMISATION TYPE ONLY
AN ASSIGNMENT PROBLEM HAS TO BE BALANCED i.e. NUMBER OF ROWS
SHOULD ALWAYS BE EQUAL TO NUMBER OF COLUMNS
SOLVE USING HAM:
TIME TAKEN TO COMPLETE A JOB (IN MINUTES)
JOB
A B C D
WORKER
1 45 40 51 67
2 57 42 63 55
3 49 52 48 64
4 41 45 60 55
REDUCED COST TABLE 1
ROW REDUCED
TIME TAKEN TO COMPLETE A JOB (IN MINUTES)
JOB
A B C D
WORKER
1 5 0 11 27
2 15 0 21 13
3 1 4 0 16
4 0 4 19 14

THE PROBLEM IS BALANCED AS NUMBER OF ROWS = NUMBER OF COLUMNS = 4

STEP 1: SELECT THE LOWEST ELEMENT OF EACH ROW, SUBTRACT IT FROM ALL
THE OTHER ELEMENTS OF THE RESPECTIVE ROW
REDUCED COST TABLE 2
COLUMN REDUCED
TIME TAKEN TO COMPLETE A JOB (IN MINUTES)
JOB
A B C D
WORKER
1 5 0 11 14
2 15 0 21 0
3 1 4 0 3
4 0 4 19 1

STEP 2: SELECT THE LOWEST ELEMENT OF EACH COLUMN (AS IN REDUCED COST
TABLE 1), SUBTRACT IT FROM ALL THE OTHER ELEMENTS OF THE RESPECTIVE
COLUMN

NOTE THAT THE ONLY CHANGE IS OBSERVED IN COLUMN D AS ALL OTHER


COLUMNS CONTAIN AT LEAST A ZERO
REDUCED COST TABLE 2
COLUMN REDUCED
TIME TAKEN TO COMPLETE A JOB (IN MINUTES)
JOB
A B C D
WORKER
1 5 0 11 14
2 15 0 21 0
3 1 4 0 3
4 0 4 19 1

STEP 3: DRAW A MINIMUM NUMBER OF LINES TO COVER ALL ZEROS OCCURING IN


THE TABLE

NOTE THAT THE ROW/COLUMN WHICH CONTAINS A LARGER NUMBER OF ZEROS


SHOULD BE THE FIRST TO BE CANCELLED
REDUCED COST TABLE 2
COLUMN REDUCED
TIME TAKEN TO COMPLETE A JOB (IN MINUTES)
JOB
A B C D
WORKER
1 5 0 11 14
2 15 0 21 0
3 1 4 0 3
4 0 4 19 1

SINCE THE MINIMUM NUMBER OF LINES = NUMBER OF ROWS/COLUMNS

THE SOLUTION IS OPTIMAL

MAKING ASSIGNMENT WILL START FROM THE ROW WHICH HAS ONLY A SINGLE
ZERO
OPTIMAL SOLUTION
WORKER JOB TIME TAKEN
(IN MINUTES)
1 B 40
2 D 55
3 C 48
4 A 41

TOTAL TIME TAKEN 184


ASSIGNMENT METHOD
IMPROVING A SOLUTION USING HAM
PROBLEM 2
JOB 1 2 3 4 5

MACHINE
A 10 3 3 2 8
B 9 7 8 2 7
C 7 5 6 2 4
D 3 5 8 2 4
E 9 10 9 6 10

USE THE ABOVE COST MATRIX TO DETERMINE (a) OPTIMAL


JOB ASSIGNMENT (b) COST OF ASSIGNMENT
REDUCED COST TABLE 1
ROW REDUCED
JOB 1 2 3 4 5

MACHINE
A 8 1 1 0 6
B 7 5 6 0 5
C 5 3 4 0 2
D 1 3 6 0 2
E 3 4 3 0 4

THE PROBLEM IS BALANCED AS NUMBER OF ROWS = NUMBER OF COLUMNS = 5

STEP 1: SELECT THE LOWEST ELEMENT OF EACH ROW, SUBTRACT IT FROM ALL
THE OTHER ELEMENTS OF THE RESPECTIVE ROW
REDUCED COST TABLE 2
COLUMN REDUCED
JOB 1 2 3 4 5

MACHINE
A 7 0 0 0 4
B 6 4 5 0 3
C 4 2 3 0 0
D 0 2 5 0 0
E 2 3 2 0 2

STEP 2: SELECT THE LOWEST ELEMENT OF EACH COLUMN (AS IN REDUCED COST
TABLE 1), SUBTRACT IT FROM ALL THE OTHER ELEMENTS OF THE RESPECTIVE
COLUMN

NOTE THAT THERE IS NO CHANGE IN COLUMN 4 AS THIS COLUMN CONTAINS ONLY


ZEROS
REDUCED COST TABLE 2
COLUMN REDUCED
JOB 1 2 3 4 5

MACHINE
A 7 0 0 0 4
B 6 4 5 0 3
C 4 2 3 0 0
D 0 2 5 0 0
E 2 3 2 0 2

STEP 3: DRAW A MINIMUM NUMBER OF LINES TO COVER ALL ZEROS OCCURING IN THE TABLE

NOTE THAT THE ROW/COLUMN WHICH CONTAINS A LARGER NUMBER OF ZEROS SHOULD BE
CANCELLED FIRST

SINCE THE MINIMUM NUMBER OF LINES ≠ NUMBER OF ROWS/COLUMNS

THE SOLUTION IS NOT OPTIMAL


REDUCED COST TABLE 2
COLUMN REDUCED
JOB 1 2 3 4 5

MACHINE
A 7 0 0 0 4
B 6 4 5 0 3
C 4 2 3 0 0
D 0 2 5 0 0
E 2 3 2 0 2

STEP 4: IMPROVE THE SOLUTION USING THE FOLLOWING STEPS:

• SELECT THE SMALLEST UNCOVERED ELEMENT, IN THIS CASE IT IS THE VALUE 2

• SUBTRACT THE SELECTED VALUE FROM ALL THE UNCOVERED ELEMENTS AND ADD IT TO
THE VALUES WHICH ARE AT THE INTERSECTION OF TWO LINES

• THE NEXT SLIDE SHOWS THE RESULTING TABLE 3


REDUCED COST TABLE 3
IMPROVED
JOB 1 2 3 4 5

MACHINE
A 7 0 0 2 6
B 4 2 3 0 3
C 2 0 1 0 0
D 0 2 5 2 2
E 0 1 0 0 2

REPEAT STEP 3

STEP 3: DRAW A MINIMUM NUMBER OF LINES TO COVER ALL ZEROS OCCURING IN THE TABLE

NOTE THAT THE ROW/COLUMN WHICH CONTAINS A LARGER NUMBER OF ZEROS SHOULD BE
CANCELLED FIRST

SINCE THE MINIMUM NUMBER OF LINES = NUMBER OF ROWS/COLUMNS

THE SOLUTION IS OPTIMAL


REDUCED COST TABLE 3
IMPROVED
JOB 1 2 3 4 5

MACHINE
A 7 0 0 2 6
B 4 2 3 0 3
C 2 0 1 0 0
D 0 2 5 2 2
E 0 1 0 0 2

MAKING ASSIGNMENT WILL START FROM THE ROW WHICH HAS ONLY A SINGLE
ZERO

FIRST B-4
FOLLOWED BY D-1 AND SO ON
OPTIMAL SOLUTION
MACHINE JOB TIME TAKEN
(IN MINUTES)
A 2 3
B 4 2
C 5 4
D 1 3
E 3 9

TOTAL TIME TAKEN 21


SUMMARISING HAM
GIVEN THE ASSIGNMENT TABLE, FOLLOW THE STEPS:

STEP 1: SELECT THE LOWEST ELEMENT OF EACH ROW, SUBTRACT IT FROM


ALL THE OTHER ELEMENTS OF THE RESPECTIVE ROW

STEP 2: SELECT THE LOWEST ELEMENT OF EACH COLUMN (AS IN REDUCED


COST TABLE 1), SUBTRACT IT FROM ALL THE OTHER ELEMENTS OF THE
RESPECTIVE COLUMN

STEP 3: DRAW A MINIMUM NUMBER OF LINES TO COVER ALL ZEROS


OCCURING IN THE TABLE, IF NUMBER OF LINES = NUMBER OF ROWS/COLUMNS
THE SOLUTION IS OPTIMAL. IF NOT GO TO STEP 4.

STEP 4: IMPROVE THE SOLUTION USING THE FOLLOWING STEPS:

• SELECT THE SMALLEST UNCOVERED ELEMENT, IN THIS CASE IT IS THE


VALUE 2

• SUBTRACT THE SELECTED VALUE FROM ALL THE UNCOVERED ELEMENTS


AND ADD IT TO THE VALUES WHICH ARE AT THE INTERSECTION OF TWO
LINES

You might also like