Research Article
Solving the Manufacturing Cell Design Problem through Binary Cat Swarm Optimization with Dynamic Mixture Ratios
| (1) | for (i to Machines) do | | (2) | for (j to Cells) do | | (3) | Count the number of cells the same machine is assigned to | | (4) | end for | | (5) | if (Assignments! = 1) then | | (6) | Calculate least cost column | | (7) | Assign the machine to the calculated least cost cell | | (8) | end if | | (9) | end for | | (10) | for (i to Machines) do | | (11) | for (j to Cells) do | | (12) | Count the number of machines in the same cell | | (13) | end for | | (14) | if (Number of grouped machines is greater than ) then | | (15) | Find cell with fewer machines assigned | | (16) | Reassign the machine to found cell | | (17) | end if | | (18) | end for |
|
