You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/75624
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAraujo, Silvio Alexandre-
dc.contributor.authorClark, Alistair-
dc.date.accessioned2014-05-27T11:29:40Z-
dc.date.accessioned2016-10-25T18:49:43Z-
dc.date.available2014-05-27T11:29:40Z-
dc.date.available2016-10-25T18:49:43Z-
dc.date.issued2013-06-10-
dc.identifierhttp://dx.doi.org/10.1016/j.cie.2013.04.003-
dc.identifier.citationComputers and Industrial Engineering, v. 65, n. 4, p. 577-585, 2013.-
dc.identifier.issn0360-8352-
dc.identifier.urihttp://hdl.handle.net/11449/75624-
dc.identifier.urihttp://acervodigital.unesp.br/handle/11449/75624-
dc.description.abstractIn many production processes, a key material is prepared and then transformed into different final products. The lot sizing decisions concern not only the production of final products, but also that of material preparation in order to take account of their sequence-dependent setup costs and times. The amount of research in recent years indicates the relevance of this problem in various industrial settings. In this paper, facility location reformulation and strengthening constraints are newly applied to a previous lot-sizing model in order to improve solution quality and computing time. Three alternative metaheuristics are used to fix the setup variables, resulting in much improved performance over previous research, especially regarding the use of the metaheuristics for larger instances. © 2013 Elsevier Ltd. All rights reserved.en
dc.format.extent577-585-
dc.language.isoeng-
dc.sourceScopus-
dc.subjectFacility location reformulation-
dc.subjectLot sizing and scheduling-
dc.subjectMetaheuristics-
dc.subjectValid inequalities-
dc.subjectFacility locations-
dc.subjectIndustrial settings-
dc.subjectLot-sizing and scheduling-
dc.subjectMaterial preparation-
dc.subjectMaterials processing-
dc.subjectMeta heuristics-
dc.subjectSequence dependent setups-
dc.subjectValid inequality-
dc.subjectHeuristic algorithms-
dc.subjectScheduling-
dc.subjectLocation-
dc.titleA priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problemen
dc.typeoutro-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.contributor.institutionUniversity of the West of England-
dc.description.affiliationDepartamento de Matemática Aplicada Universidade Estadual Paulista (Unesp), Rua Cristovão Colombo 2265, São José do Rio Preto, SP 15054-000-
dc.description.affiliationDepartment of Engineering Design and Mathematics University of the West of England, Coldharbour Lane, Bristol BS16 1QY-
dc.description.affiliationUnespDepartamento de Matemática Aplicada Universidade Estadual Paulista (Unesp), Rua Cristovão Colombo 2265, São José do Rio Preto, SP 15054-000-
dc.identifier.doi10.1016/j.cie.2013.04.003-
dc.identifier.wosWOS:000322563200007-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofComputers and Industrial Engineering-
dc.identifier.scopus2-s2.0-84878524522-
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.