ASSIGNMENT ON ASSIGNMENT PROBLEM

SUBMITTED TO MR. VIVEK ROHIRA (OPERATION RESEARCH FACULTY)

SUBMITTED BY ANJALI SAHANI (M.B.A IIND SEM.)

OBJECTIVE OF ASSIGNMENT PROBLEM

ASSIGNMENT PROBLEM ARE THE TYPE OF LINEAR PROGRAMING PROBLEM IN WHICH WE HAVE TO FIND THE OPTIMUM ALLOCATION OF A NO. OF TASK TO AN EQUAL NO. OF PERSONS.

HUNGARIAN METHOD
THIS IS THE WORKING METHOD TO SOLVING MINIMAL ASSIGN PROBLEM.

FOR EXAMPLEI A B C D 8 13 38 19 II 26 28 19 26 III 17 4 18 24 IV 11 26 15 10

STEP 1ROW REDUCTION MATRIX

SUBTRACT THE MINIMUM ELEMENT OF EACH ROW IN THE COST MATRIX FROM EVERY ELEMENT OF THE CORROSPONDING ROW TO GET ROW REDUCTION MATRIX.
HIGHLIGHTING MINIMUM NO.
I A
B C D SUBTRACT THE MINIMUM NO FROM EACH ROW I II III IV

II 26
28 19 26

III 17
4 18 24

IV 11
26 15 10

8
13 38 19

A B
C D

0 9
23 9

18 24
4 16

9 0
3 14

3 22
0 0

SUBTRACT THE MINIMUM ELEMENT OF EACH COLOUMN IN THE REDUCED MATRIX FROM EVERY ELEMENT OF THE CORROSPONDING COLOUMN TO GET THE COLOUMN REDUCED MATRIX.
I
A B C D 0 9 23 9

STEP 2COLOUMN REDUCTION MATRIX

II
14 20 0 12

III
9 0 3 14

IV
3 22 0 0

STEP-3 ZERO MATRIX

IN THE MATRIX OBTAINED THE STEP -2 EXAMINE ALL ROWS STARTING WITH 1ST ROW WITH EXACTLY ONE ZERO ELEMENT IS FOUND MARK ( ) AT THIS ZERO ASSIGHMENT AND MARK (X) AT ALL THE OTHER ZERO IN THE COLOUMN, TO SHOW THAT THEY CANNOT BE USED TO MAKE OTHER ASSIGHNMENT.
I II III IV

A
B

O
9

14
20

9
0

3
22

C
D

23
9

0
12

3
14

0
0

STEP -4
DUTIES ASSIGHNED TO EACH PERSON IN HOW MUCH TIMEPERSON
A B C D

JOB
I III II IV

NO OF HOURS
8 4 19 10 TOTAL NO OF HRS= 41 HRS

Problems
THERE ARE 5 JOBS TO BE ASSIGHNED 1 EACH TO 5 MACHINES AND THE ASSOCIATED COST MATRIX IS A S FOLLOWSI A B C D E 11 19 13 21 14 II 17 7 16 24 10 III 18 12 15 17 12 IV 16 6 12 28 11 V 20 15 16 26 15

STEP-1 ROW REDUCTION MATRIX

HIGHLIGHTING THE LOWEST NO FROM EACH ROW I A B C D E 11 19 13 21 14 II 17 7 16 24 10 III 8 12 15 17 12 IV 16 6 12 28 11 V 20 15 16 26 15 A B C D E

SUBTRACT THE MINIMUM NO FROM EACH ROW

I 3 3 1 4 4 II 9 1 4 7 0 III 0 6 3 0 2 IV 8 0 0 11 1 V 12 9 4 9 5

STEP-2 COLOUMN REDUCTION MATRIX

I A B 2 2 II 9 1 III 0 6 IV 8 0 V 8 5

C
D E

0
3 3

4
7 0

3
0 2

0
11 1

0
5 1

STEP-3 ZERO MATRIX

I A B C D E 2 2 0 3 3

II 9 1 4 7 0

III 0 6 3 0 2

IV 8 0 O 11 1

V 8 5 O 5 1

WHEN ALL JOBS ARE NOT ASSIGHNED THEN WE DRAW THE MINIMUM NO. OF HORIZONTAL AND VERTICAL LINES TO COVER ALL THE ZEROS. FOR THIS WE PROCEED,
1. 2. 3. 4.

5.

MARK ALL ROWS FOR WHICH ASSIGHNMENT HAVE NOT BEEN MADE. MARK COLOUMN WHICH HAVE ZERO IN MARK ROW. MARK ROW WHICH HAVE ASSIGHNMENT IN MARK COLOUMN. DRAW MINIMUM NO OF LINES THROUGH UNMARK ROW & MARK COLOUMN TO COVER ALL THE ROWS. SELECT THE COLOUMN WHICH DO NOT HAVE THE LINE.

I A B C D E 2 2 0 3 3

II 9 1 4 7 0

III L4 0 6 3 0 2

IV 8 0 0 11 1

V 8 5 0 5 1 L3 LI L2

6. SELECT THE SMALLEST ELEMENT THAT DO NOT

HAVE LINE. 7. SUBTRACT IT FROM ALL THE ELEMENT THAT HAVE LINE , THROUGH THAT ADD IT TO EVERY ELEMENT THAT LIES AT THE INTERSECTION OF 2 LINES & LEAVE THE REMAINING ELEMENT.
SMALLEST ELEMENT I A 2 II 9 III
L4

ASSIGHNED JOBS IV 8 V 8 A B C D E I 0 2 0 1 3 II 7 1 4 5 0 III 0 8 5 0 4 IV 6 0 0 9 1 V 6 5 0 3 1

B
C D

2
0 3

1
4 7

6
3 0

0
0 11

5
L1

0
L2

1
L3

DUTIES ASSIGHNED TO EACH PERSON IN HOW MANY HOURS PERSONS JOBS HOURS
A B C D E I IV V III II 11 6 16 17 10

TOTAL NO OF HRS= 60 ANS.

TRAVELLING SALES PERSON PROBLEM(TSP)

IT IS SIMILAR TO ASSIGHNMENT PROBLEM , A SALES PERSON WANTS TO MINIMISE THE DISTANCE , TIME & COST IN VISITING CITIES. TO SOLVE SUCH TYPE OF PROBLEM WE HAVE TO FIND A SET OF AN ELEMENTS SELECTING ONE ELEMENT FROM EACH ROW & COLOUMN SO THAT THEIR SUM IS MINIMUM.

MATRIX OF SET UP COST IS GIVEN AS

A1 A1 A2 M 6 A2 2 M A3 5 3 A4 7 8 A5 1 2

A3
A4 A5

8
12 1

7
4 3

M
6 2

4
M 8

7
5 M

STEP-1 ROW REDUCTION MATRIX

HIGHLIGHT MINIMUM NO. SUBTRACT MINIMUM ELEMENT FROM EACH ROW

A1 A1 A2 A3 A4 A5 M 6 8 12 1

A2 2 M 7 4 3

A3 5 3 M 6 2

A4 7 8 4 M 8

A5 1 2 7 5 M A1

A1 M

A2 1

A3 4

A4 6

A5 0

A2
A3 A4 A5

4
4 8 0

M
3 0 2

1
M 2 1

6
0 M 7

0
3 1 M

STEP-2 COLOUMN REDUCTION MATRIX

A1 A1 A2 A3 A4 A5 M 4 4 8 0 A2 1 M 3 0 2 A3 3 O M 1 0 A4 6 6 0 M 7 A5 0 0 3 1 M

STEP-3 ZERO MATRIX

A1
A1 A2 A3 A4 A5 M 4 4 8 0

A2
1 M 3 0 2

A3
3 0 M 1 0

A4
6 6 0 M 7

A5
0 0 3 1 M

A1 A5 A5 A1

THE MATIX DOES NOT PROVIDE THE SOLUTION OF ORIGINAL PROBLEM BECAUSE THE PATH A1A5, A5A1 IS WRONG SO TO FIND THE BEST SOLUTION WE TALKE THE NEXT MINIMUM ELEMENT i.e.; 1 IN THE MATRIX TO GET THE SOLUTION.

A1 A1 A2 M 4

A2 1 M

A3 3 0

A4 6 6

A5 0 0 A1A2A3A4A5A1 COST= 2+3+4+5+1 =15 TOTAL MINIMUM COST

A3
A4 A5

4
8 0

3
0 2

M
1 0

0
M 7

3
1 M