Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers

dc.contributor.authordo Nascimento, D. N. [UNESP]
dc.contributor.authorde Araujo, S. A. [UNESP]
dc.contributor.authorCherri, A. C. [UNESP]
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2020-12-12T02:20:20Z
dc.date.available2020-12-12T02:20:20Z
dc.date.issued2020-01-01
dc.description.abstractThis paper addresses the integration of the lot-sizing problem and the one-dimensional cutting stock problem with usable leftovers (LSP-CSPUL). This integration aims to minimize the cost of cutting items from objects available in stock, allowing the bringing forward production of items that have known demands in a future planning horizon. The generation of leftovers, that will be used to cut future items, is also allowed and these leftovers are not considered waste in the current period. Inventory costs for items and leftovers are also considered. A mathematical model for the LSP-CSPUL is proposed to represent this problem and an approach, using the simplex method with column generation, is proposed to solve the linear relaxation of this model. A heuristic procedure, based on a relax-and-fix strategy, was also proposed to find integer solutions. Computational tests were performed and the results show the contributions of the proposed mathematical model, as well as, the quality of the solutions obtained using the proposed method.en
dc.description.affiliationDepartamento de Engenharia de Produção FEB UNESP
dc.description.affiliationDepartamento de Matemática IBILCE UNESP
dc.description.affiliationDepartamento de Matemática FC UNESP
dc.description.affiliationUnespDepartamento de Engenharia de Produção FEB UNESP
dc.description.affiliationUnespDepartamento de Matemática IBILCE UNESP
dc.description.affiliationUnespDepartamento de Matemática FC UNESP
dc.identifierhttp://dx.doi.org/10.1007/s10479-020-03772-9
dc.identifier.citationAnnals of Operations Research.
dc.identifier.doi10.1007/s10479-020-03772-9
dc.identifier.issn1572-9338
dc.identifier.issn0254-5330
dc.identifier.scopus2-s2.0-85089826355
dc.identifier.urihttp://hdl.handle.net/11449/200949
dc.language.isoeng
dc.relation.ispartofAnnals of Operations Research
dc.sourceScopus
dc.subjectCutting stock problem
dc.subjectHeuristic procedure
dc.subjectLot-sizing problem
dc.subjectMathematical modeling
dc.subjectUsable leftovers
dc.titleIntegrated lot-sizing and one-dimensional cutting stock problem with usable leftoversen
dc.typeArtigo
unesp.author.orcid0000-0003-1934-4682[3]

Arquivos