Mostrar el registro sencillo del ítem

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorZuñiga G.
dc.contributor.authorMonfroy E.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:16:03Z
dc.date.available2020-09-02T22:16:03Z
dc.date.issued2014
dc.identifier10.1007/978-3-319-07857-1_87
dc.identifier.citation434 PART I, , 498-502
dc.identifier.issn18650929
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4171
dc.descriptionThe manufacturing cell design problem aims at organizing a manufacturing plant in cells that contain machines processing parts from a same family for a given product. The purpose is to minimize the flow of parts among cells so as to increase productivity while reducing costs. This paper focuses on comparing metaheuristics and constraint programming -from a modeling standpoint- when used to solve this problem. © Springer International Publishing Switzerland 2014.
dc.language.isoen
dc.publisherSpringer Verlag
dc.subjectConstraint Programming
dc.subjectManufacturing Cell Design
dc.subjectMetaheuristics
dc.subjectComputer programming
dc.subjectConstraint theory
dc.subjectFlexible manufacturing systems
dc.subjectHeuristic algorithms
dc.subjectProduct design
dc.subjectCell design
dc.subjectConstraint programming
dc.subjectManufacturing plant
dc.subjectMeta heuristics
dc.subjectReducing costs
dc.subjectProblem solving
dc.titleModeling Manufacturing Cell Design Problems: CP vs. MH
dc.typeConference Paper


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem