Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers
Autor(a) principal: | |
---|---|
Data de Publicação: | 2020 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1007/s10479-020-03772-9 http://hdl.handle.net/11449/200949 |
Resumo: | This 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. |
id |
UNSP_dc327bacd5cf5f08349b3be78b4c70f0 |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/200949 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Integrated lot-sizing and one-dimensional cutting stock problem with usable leftoversCutting stock problemHeuristic procedureLot-sizing problemMathematical modelingUsable leftoversThis 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.Departamento de Engenharia de Produção FEB UNESPDepartamento de Matemática IBILCE UNESPDepartamento de Matemática FC UNESPDepartamento de Engenharia de Produção FEB UNESPDepartamento de Matemática IBILCE UNESPDepartamento de Matemática FC UNESPUniversidade Estadual Paulista (Unesp)do Nascimento, D. N. [UNESP]de Araujo, S. A. [UNESP]Cherri, A. C. [UNESP]2020-12-12T02:20:20Z2020-12-12T02:20:20Z2020-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://dx.doi.org/10.1007/s10479-020-03772-9Annals of Operations Research.1572-93380254-5330http://hdl.handle.net/11449/20094910.1007/s10479-020-03772-92-s2.0-85089826355Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengAnnals of Operations Researchinfo:eu-repo/semantics/openAccess2024-06-28T13:18:21Zoai:repositorio.unesp.br:11449/200949Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T20:49:15.191906Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers |
title |
Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers |
spellingShingle |
Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers do Nascimento, D. N. [UNESP] Cutting stock problem Heuristic procedure Lot-sizing problem Mathematical modeling Usable leftovers |
title_short |
Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers |
title_full |
Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers |
title_fullStr |
Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers |
title_full_unstemmed |
Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers |
title_sort |
Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers |
author |
do Nascimento, D. N. [UNESP] |
author_facet |
do Nascimento, D. N. [UNESP] de Araujo, S. A. [UNESP] Cherri, A. C. [UNESP] |
author_role |
author |
author2 |
de Araujo, S. A. [UNESP] Cherri, A. C. [UNESP] |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (Unesp) |
dc.contributor.author.fl_str_mv |
do Nascimento, D. N. [UNESP] de Araujo, S. A. [UNESP] Cherri, A. C. [UNESP] |
dc.subject.por.fl_str_mv |
Cutting stock problem Heuristic procedure Lot-sizing problem Mathematical modeling Usable leftovers |
topic |
Cutting stock problem Heuristic procedure Lot-sizing problem Mathematical modeling Usable leftovers |
description |
This 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. |
publishDate |
2020 |
dc.date.none.fl_str_mv |
2020-12-12T02:20:20Z 2020-12-12T02:20:20Z 2020-01-01 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://dx.doi.org/10.1007/s10479-020-03772-9 Annals of Operations Research. 1572-9338 0254-5330 http://hdl.handle.net/11449/200949 10.1007/s10479-020-03772-9 2-s2.0-85089826355 |
url |
http://dx.doi.org/10.1007/s10479-020-03772-9 http://hdl.handle.net/11449/200949 |
identifier_str_mv |
Annals of Operations Research. 1572-9338 0254-5330 10.1007/s10479-020-03772-9 2-s2.0-85089826355 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Annals of Operations Research |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1808129253566316544 |