Show simple item record

dc.contributor.authorSoto R.
dc.contributor.authorKjellerstrand H.
dc.contributor.authorDurán O.
dc.contributor.authorCrawford B.
dc.contributor.authorMonfroy E.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:28:46Z
dc.date.available2020-09-02T22:28:46Z
dc.date.issued2012
dc.identifier10.1016/j.eswa.2012.04.020
dc.identifier.citation39, 13, 11423-11427
dc.identifier.issn09574174
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6338
dc.descriptionCell 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.
dc.language.isoen
dc.subjectBoolean satisfiability
dc.subjectConstraint programming
dc.subjectMachine grouping
dc.subjectManufacturing cells
dc.subjectA plants
dc.subjectBoolean satisfiability
dc.subjectCell formation
dc.subjectComputational costs
dc.subjectConstraint programming
dc.subjectEvolutionary computing
dc.subjectGlobal optimal solutions
dc.subjectGlobaloptimum
dc.subjectMachine grouping
dc.subjectOptimization models
dc.subjectRuntimes
dc.subjectComputer programming
dc.subjectConstraint theory
dc.subjectGroup technology
dc.subjectMathematical programming
dc.subjectCellular manufacturing
dc.titleCell formation in group technology using constraint programming and Boolean satisfiability
dc.typeArticle


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record