Show simple item record

dc.contributor.authorSotoyz R.
dc.contributor.authorCrawford B.
dc.contributor.authorAlmonacid B.
dc.contributor.authorParedes F.
dc.contributor.authorLoyola E.
dc.date.accessioned2020-09-02T22:28:46Z
dc.date.available2020-09-02T22:28:46Z
dc.date.issued2016
dc.identifier10.1109/SCCC.2015.7416567
dc.identifier.citation2016-February, , -
dc.identifier.issn15224902
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6341
dc.descriptionMachine-Part Cell Formation consists on organizing a plant as a set of cells, each one of them processing machines containing different part types. In recent years, different techniques have been used to solve this problem ranging from exact to approximate methods. This paper focuses on solving new instances of this problem for which no optimal value exists by using the classic Boctor's mathematical model. We employ constraint programming as the underlying solving technique illustrating that global optimums are achieved for the whole set of tested instances. © 2015 IEEE.
dc.language.isoen
dc.publisherIEEE Computer Society
dc.subjectConstraint Programming
dc.subjectMachine-Part Cell Formation
dc.subjectOptimization
dc.subjectCells
dc.subjectCellular manufacturing
dc.subjectComputer programming
dc.subjectConstraint theory
dc.subjectCytology
dc.subjectMachinery
dc.subjectOptimization
dc.subjectApproximate methods
dc.subjectCell formation
dc.subjectCell formation problem
dc.subjectConstraint programming
dc.subjectGlobal optimum
dc.subjectOptimal values
dc.subjectProcessing machines
dc.subjectProblem solving
dc.titleMachine-part cell formation problems with constraint programming
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record