A genetic algorithm approach to the machine-component grouping problem with multiple objectives
Computers and Industrial Engineering
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A tabu search approach to the cell formation problem
Computers and Industrial Engineering
Cell formation in group technology: review, evaluation and directions for future research
Computers and Industrial Engineering - Cellular manufacturing systems: design, analysis and implementation
A machine program for theorem-proving
Communications of the ACM
A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell formation problem
Computers and Operations Research
A hybrid grouping genetic algorithm for the cell formation problem
Computers and Operations Research
A simulated annealing algorithm for manufacturing cell formation problems
Expert Systems with Applications: An International Journal
The Design of the Zinc Modelling Language
Constraints
Universal Booleanization of Constraint Models
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Handbook of Knowledge Representation
Handbook of Knowledge Representation
Collaborative particle swarm optimization with a data mining technique for manufacturing cell design
Expert Systems with Applications: An International Journal
MiniZinc: towards a standard CP modelling language
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Lazy clause generation reengineered
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A fast linear-arithmetic solver for DPLL(T)
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
A system for solving constraint satisfaction problems with SMT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
On SAT modulo theories and optimization problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Views and iterators for generic constraint implementations
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Multiple objective decision making approach to cell formation: A goal programming model
Mathematical and Computer Modelling: An International Journal
| Hi-index | 12.05 |
Cell formation consists in organizing a plant as a set of cells, each of them containing machines that process similar types or families of parts. The idea is to minimize the part flow among cells in order to reduce costs and increase productivity. The literature presents different approaches devoted to solve this problem, which are mainly based on mathematical programming and on evolutionary computing. Mathematical programming can guarantee a global optimal solution, however at a higher computational cost than an evolutionary algorithm, which can assure a good enough optimum in a fixed amount of time. In this paper, we model and solve this problem by using state-of-the-art constraint programming (CP) techniques and Boolean satisfiability (SAT) technology. We present different experimental results that demonstrate the efficiency of the proposed optimization models. Indeed, CP and SAT implementations are able to reach the global optima in all tested instances and in competitive runtime.