Machine-part cell formation problems with constraint programming

Vista sencilla de ítem
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorAlmonacid, B.es_ES
dc.contributor.authorParedes, F.es_ES
dc.contributor.authorLoyola, E.es_ES
dc.date.accessioned6/22/2022 13:33
dc.date.accessioned2022-09-30T16:09:24Z
dc.date.available6/22/2022 13:33
dc.date.available2022-09-30T16:09:24Z
dc.date.issued2016
dc.description.abstractMachine-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.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1109/SCCC.2015.7416567es_ES
dc.identifier.urihttps://doi.org/10.1109/SCCC.2015.7416567
dc.language.isoenges_ES
dc.publisherIEEE Computer Societyes_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/es_ES
dc.sourceProceedings - International Conference of the Chilean Computer Science Society, SCCCes_ES
dc.subjectComputer Sciencees_ES
dc.subjectEngineeringes_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#1.02.01es_ES
dc.titleMachine-part cell formation problems with constraint programminges_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
67. Machine-part cell formation problems with constraint programming.pdf
Tamaño:
186.54 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso