Show simple item record

dc.contributor.authorFiorotto, Diego Jacinto [UNESP]
dc.contributor.authorAraujo, Silvio Alexandre de [UNESP]
dc.date.accessioned2014-12-03T13:11:09Z
dc.date.available2014-12-03T13:11:09Z
dc.date.issued2014-06-01
dc.identifierhttp://dx.doi.org/10.1007/s10479-014-1570-1
dc.identifier.citationAnnals Of Operations Research. Dordrecht: Springer, v. 217, n. 1, p. 213-231, 2014.
dc.identifier.issn0254-5330
dc.identifier.urihttp://hdl.handle.net/11449/112920
dc.description.abstractWe consider the capacitated lot sizing problem with multiple items, setup time and unrelated parallel machines. The aim of the article is to develop a Lagrangian heuristic to obtain good solutions to this problem and good lower bounds to certify the quality of solutions. Based on a strong reformulation of the problem as a shortest path problem, the Lagrangian relaxation is applied to the demand constraints (flow constraint) and the relaxed problem is decomposed per period and per machine. The subgradient optimization method is used to update the Lagrangian multipliers. A primal heuristic, based on transfers of production, is designed to generate feasible solutions (upper bounds). Computational results using data from the literature are presented and show that our method is efficient, produces lower bounds of good quality and competitive upper bounds, when compared with the bounds produced by another method from the literature and by high-performance MIP software.en
dc.description.sponsorshipFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.format.extent213-231
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofAnnals of Operations Research
dc.sourceWeb of Science
dc.subjectLot sizingen
dc.subjectParallel machinesen
dc.subjectReformulationsen
dc.subjectLagrangian heuristicen
dc.titleReformulation and a Lagrangian heuristic for lot sizing problem on parallel machinesen
dc.typeArtigo
dcterms.licensehttp://www.springer.com/open+access/authors+rights?SGWID=0-176704-12-683201-0
dcterms.rightsHolderSpringer
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)
dc.description.affiliationUNESP Univ Estadual Paulista, IBILCE, Dept Matemat Aplicada, BR-15054000 Sao Jose Do Rio Preto, SP, Brazil
dc.description.affiliationUnespUNESP Univ Estadual Paulista, IBILCE, Dept Matemat Aplicada, BR-15054000 Sao Jose Do Rio Preto, SP, Brazil
dc.identifier.doi10.1007/s10479-014-1570-1
dc.identifier.wosWOS:000337184500009
dc.rights.accessRightsAcesso restrito
dc.description.sponsorshipIdFAPESP: 10/16727-9
dc.description.sponsorshipIdFAPESP: 11/22647-0
unesp.campusUniversidade Estadual Paulista (UNESP), Instituto de Biociências Letras e Ciências Exatas, São José do Rio Pretopt
dc.identifier.lattes9919773182316062
dc.identifier.orcid0000-0002-4762-2048
unesp.author.lattes9919773182316062
unesp.author.orcid0000-0002-4762-2048[2]
dc.relation.ispartofjcr1.864
dc.relation.ispartofsjr0,943
Localize o texto completo

Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record