4.- Assignment Method for Cellularization
Uploaded by
Oscar Sotomayor4.- Assignment Method for Cellularization
Uploaded by
Oscar SotomayorAssignment 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
Resolver el problema de Matlab grader
Matriz de distancias dado Matriz de Incidencia
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
Taller en Matlab Grader
CELULARIZACIÓN: Asignación de partes (familia de partes) dado una matriz de incidencia y un grupo de máquina
s
• MEASURES OF PERFORMACE
• Minimize E
• Minimize E+B
• Grouping efficiency
• Grouping efficacy
