Cell formation in group technology using constraint programming and Boolean satisfiability

Ricardo Soto, Hakan Kjellerstrand, Orlando Durán, Broderick Crawford, Eric Monfroy, Fernando Paredes

Research output: Contribution to journalArticlepeer-review

37 Scopus citations


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.

Original languageEnglish
Pages (from-to)11423-11427
Number of pages5
JournalExpert Systems with Applications
Issue number13
StatePublished - 1 Oct 2012


  • Boolean satisfiability
  • Constraint programming
  • Machine grouping
  • Manufacturing cells


Dive into the research topics of 'Cell formation in group technology using constraint programming and Boolean satisfiability'. Together they form a unique fingerprint.

Cite this