Cell formation in group technology using constraint programming and Boolean satisfiability


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. 2012 Elsevier Ltd. All rights reserved.

DOI: 10.1016/j.eswa.2012.04.020

Extracted Key Phrases

8 Figures and Tables

Cite this paper

@article{Soto2012CellFI, title={Cell formation in group technology using constraint programming and Boolean satisfiability}, author={Ricardo Soto and H{\aa}kan Kjellerstrand and Orlando Dur{\'a}n and Broderick Crawford and Eric Monfroy and Fernando Paredes}, journal={Expert Syst. Appl.}, year={2012}, volume={39}, pages={11423-11427} }