Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2017-02-03T17:00:28Z
dc.date.available 2017-02-03T17:00:28Z
dc.date.issued 2016
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/58433
dc.description.abstract The aim of this work is to present a mathematical model for the optimal design and planning of a supply chain, where several plants that produce different products can be installed forming clusters. In order to analyze facilities integration, discounts in installation and production costs are assumed. In addition, the tradeoffs between clusters and individual facility configurations are assessed. This work also focuses on the effect of the production scale in the overall SC, and the costs reduction when plants share resources and services. en
dc.format.extent 143-154 es
dc.language en es
dc.subject Modelos Matemáticos es
dc.subject cadena de suministros es
dc.title Optimal supply chain design: a comparison of individual factories and industrial clusters allocation en
dc.type Objeto de conferencia es
sedici.identifier.uri http://45jaiio.sadio.org.ar/sites/default/files/1777-4957-1-DR_0.pdf es
sedici.identifier.issn 2451-7542 es
sedici.creator.person Vanzetti, Nicolás es
sedici.creator.person Montagna, Jorge Marcelo es
sedici.creator.person Corsano, Gabriela es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Sociedad Argentina de Informática e Investigación Operativa (SADIO) es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)
sedici.rights.uri http://creativecommons.org/licenses/by-sa/3.0/
sedici.date.exposure 2016-09
sedici.relation.event V Simposio Argentino de Informática Industrial (SII 2016) - JAIIO 45 (Tres de Febrero, 2016) es
sedici.description.peerReview peer-review es


Descargar archivos

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

Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)