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 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
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
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
| Hi-index | 0.00 |
A manufacturing cell design problem (MCDP) consists in creating an optimal production plant layout. The production plant is composed of cells which in turn are composed of machines that process part families of products. The goal is to minimize part flow among cells in order to reduce production costs and increase productivity. In this paper, we focus on modeling and solving the MCDP by using state-of-the-art constraint programming (CP) techniques. We implement different optimization models and we solve it by using two solving engines. Our preliminary results demonstrate the efficiency of the proposed implementations, indeed the global optima is reached in all instances and in competitive runtime.