Scribd
Upload
33 views

Assignment Method For Cellularization

This document outlines the steps to solve an assignment problem using the Hungarian method. It involves: 1. Balancing rows and columns by subtracting minimum values. 2. Drawing lines to cover all zeros, scanning rows then columns. 3. If zeros aren't covered, subtract the minimum uncovered value and repeat. 4. The optimal assignment matches squares along the lines, minimizing the total cost. The example assigns jobs to operators, with the solution being Job 1 to Operator 5, etc to minimize the total cost.

Uploaded by

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

Assignment Method For Cellularization

This document outlines the steps to solve an assignment problem using the Hungarian method. It involves: 1. Balancing rows and columns by subtracting minimum values. 2. Drawing lines to cover all zeros, scanning rows then columns. 3. If zeros aren't covered, subtract the minimum uncovered value and repeat. 4. The optimal assignment matches squares along the lines, minimizing the total cost. The example assigns jobs to operators, with the solution being Job 1 to Operator 5, etc to minimize the total cost.

Uploaded by

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

Assignment Method for

Cellularization
EPN-FIM-2018
REMEMBER – ASSIGMENT PROBLEM
• TYPES OF ASSIGMENT PROBLEM
• I .- Balance Assignment Problem – Same Rows and columns
• II..- Unbalanced Assignment Problem – Make it balance
EXAMPLE
• Assign JOBS to OPERATORS
PHASE 1 .- ROW AND COLUMN REDUCTION
• Step1: subtract the minimum value of each row from the entries of that row

• Step2: subtract the minimum value of each column from the entries of the
that column
PHASE 2 .- OPTIMIZATION OF THE PROBLEM
• STEP 1 : Draw a minimum number of lines to cover all the zeros in
that matrix.
• A) ROW SCANNING
• i) starting from the first row, ask the following question: is there exactly one zero in that
row? If yes, mark a square around that zero entry and draw a vertical line passing
through that zero; otherwise, skip that row.
• ii) after scanning the last row, check whether all the zeros are covered with lines. If yes,
go to step 2; otherwise do column scanning
• B) COLUMN SCANNING
• i) Starting from the first column, ask the following question. Is there exactly one zero in
that column?. If yes, mark a square around that zero entry and draw a horizontal line
passing through that zero; otherwise skip that column
• ii) after scanning last column, check whether all zeros are covered. Go to step 2
• STEP 2 : Check whether the number of square market is equal to the
number of rows of the matrix. If yes, go to step 5; otherwise, go to
step 3.
• STEP 3 : Identify the minimum value of the undeleted cell values.
• A) add the minimum undeleted cell value at the intersection points in the
present matrix.
• B) subtract the minimum undeleted cell value from all undeleted cell values.
• C) all the other entries remain the same.
• STEP 4 : Go to step 1.
• STEP 5 : Treat the solution as market by squares.
FINAL SOLUTION
JOB 1 OPERATOR 5
JOB 2 OPERATOR 1
JOB 3 OPERATOR 3
JOB 4 OPERATOR 2
JOB 5 OPERATOR 4
ANOTHER EXAMPLE WITH DIAGONAL RULE
FOR OUR PROBLEM
The solution to the assignment problem is
X13=X26=X34=X41=X52=X65=1 with Z=14
From this solution we observe that machine 1 is assigned to
machine 3,
Which is assigned to machine 4. Machine 4 is assigned to
machine 1.
We observe a subtour 1-3-4-1 out of the assignments.
Therefore the three machines [1,3,4] form a group.
Similarly the machine cell [2,6,5] is formed.
Applying the maximum density rule the corresponding part
families are
[1,4,5,6] and [2,3,7,8]. There are 4 Intercell Moves.
Another example
• We started with parts as base ad assign machines
Final solution

14
• MEASURES OF PERFORMACE
• Minimize E
• Minimize E+B
• Grouping efficiency
• Grouping efficacy

You might also like