Presentation is loading. Please wait.

Presentation is loading. Please wait.

Unbalanced Assignment Model Lecture 24 By Dr. Arshad Zaheer.

Similar presentations


Presentation on theme: "Unbalanced Assignment Model Lecture 24 By Dr. Arshad Zaheer."— Presentation transcript:

1 Unbalanced Assignment Model Lecture 24 By Dr. Arshad Zaheer

2 RECAP  Assignment Model (Maximization)  Hungarian Method  Steps Involved  Illustrations  Optimal Assignment

3 Unbalanced Assignment Problem Case 1 This is the case when the total number of machines exceeds total number of jobs. In this case, introduce required number of fictitious or dummy jobs at ‘0’ cost or at the cost stated in the problem to get the balanced assignment problem. Then use the assignment technique to obtain the optimal assignment. The fictitious or dummy jobs assigned to the machines mean that the corresponding machine will not be assigned any job.

4 Unbalanced Assignment Problem Case 2 This is the case when the total number of jobs exceeds total number of machines. In this case, introduce required number of fictitious or dummy machines at ‘0’ cost or at the cost stated in the problem to get the balanced assignment problem. Then use the assignment technique to obtain the optimal assignment. The jobs which are assigned fictitious or dummy machines will be left over.

5 Illustration Machines exceeds Jobs

6 Problem J1J1 J2J2 J3J3 J4J4 M1M M2M M3M M4M M5M M6M Requirement: Which job is to assign which machine to get the minimum cost In this given problem, there are only four jobs while six machines. In an ideal condition there should be equal no of jobs so we need to make them equal. For this purpose we will introduce two fictitious jobs at zero cost.

7 J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M M2M M3M M4M M5M M6M Balanced Problem

8 J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 Min. Row M1M M2M M3M M4M M5M M6M Step 1. Identify minimum of each row

9 Subtract identified no from each and every entry of corresponding row J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 Min. Row M1M M2M M3M M4M M5M M6M

10 Step 2. identify minimum of column J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M M2M M3M M4M M5M M6M Min. column

11 Subtract identified no from each and every entry of corresponding column J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M M2M M3M M4M M5M M6M Min. column

12 J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M M2M M3M M4M M5M M6M

13 J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M1 M2M2 M3M3 M4M4 M5M5 M6M6

14 J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M1 M2M2 M3M3 M4M4 M5M5 M6M6

15 J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M1 M2M2 M3M3 M4M4 M5M5 M6M6

16 Original Tableau J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M1 243*3* 5 00 M2M2 38*8* M3M * 00 M4M *0*0 M5M5 2*2* M6M *0*

17 Optimal Distribution M  J3=3 M  J2=8 M  J4=10 M  J5=0 M  J1=2 M  J6=0 TOTAL =23

18 Illustration Jobs exceeds Machines

19 Problem J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M M2M M3M M4M Requirement: Which job is to assign which machine to get the minimum cost In this given problem, there are only four machines but six jobs. In an ideal condition there should be equal no of jobs so we need to make them equal. For this purpose we will introduce two fictitious Machines at zero cost.

20 Balanced Problem J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M M2M M3M M4M M5M M6M

21 Step 1. Identify minimum of each row J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 Min. Row M1M M2M M3M M4M M5M M6M

22 Subtract identified no from each and every entry of corresponding row J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 Min. Row M1M M2M M3M M4M M5M M6M

23 Step 2. identify minimum of column J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M M2M M3M M4M M5M M6M Min. Column

24 J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M M2M M3M M4M M5M M6M

25 J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M1 M2M2 M3M3 M4M4 M5M5 M6M6

26 J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M1 M2M2 M3M3 M4M4 M5M5 M6M6

27 Original Tableau J1J1 J2J2 J3J3 J4J4 J5J5 J6J6 M1M *2*3 M2M2 38*8* M3M * 1816 M4M4 3*3* M5M5 000*0*000 M6M *0*

28 Optimal Distribution M  J5=2 M  J2=8 M  J4=10 M  J1=3 M  J3=0 M  J6=0 TOTAL =23

29


Download ppt "Unbalanced Assignment Model Lecture 24 By Dr. Arshad Zaheer."

Similar presentations


Ads by Google