LOT SIZING AND CUTTING STOCK PROBLEMS IN A PAPER PRODUCTION PROCESS
Autor(a) principal: | |
---|---|
Data de Publicação: | 2021 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Pesquisa operacional (Online) |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382021000500402 |
Resumo: | ABSTRACT In many manufacturing industries, the production process involves the production of objects and the cutting of such objects into smaller pieces in order to meet a specific demand. In the optimization of these processes, one can identify the lot sizing and the cutting stock problems. In the literature, these problems are mostly separately dealt. However, treating these two problems in an integrated approach can decrease overall costs. In this research, we deal with the coupled lot sizing and cutting stock problem. It is proposed a mathematical formulation for the production and cutting of paper based on a real case, which considers setup costs and limited machine capacity in the production process of the objects. For the solution of the proposed model, we used a column generation approach and a relax-and-fix heuristic. Computational tests were carried out in order to analyze the methodology used in the resolution of the model. The results showed to be competitive in a reasonable computational time. |
id |
SOBRAPO-1_059a236c3eb7966056a12106144486dd |
---|---|
oai_identifier_str |
oai:scielo:S0101-74382021000500402 |
network_acronym_str |
SOBRAPO-1 |
network_name_str |
Pesquisa operacional (Online) |
repository_id_str |
|
spelling |
LOT SIZING AND CUTTING STOCK PROBLEMS IN A PAPER PRODUCTION PROCESScutting stock problemlot sizing problemintegratedRelax-and-Fix heuristiccolumn generationpaper industryABSTRACT In many manufacturing industries, the production process involves the production of objects and the cutting of such objects into smaller pieces in order to meet a specific demand. In the optimization of these processes, one can identify the lot sizing and the cutting stock problems. In the literature, these problems are mostly separately dealt. However, treating these two problems in an integrated approach can decrease overall costs. In this research, we deal with the coupled lot sizing and cutting stock problem. It is proposed a mathematical formulation for the production and cutting of paper based on a real case, which considers setup costs and limited machine capacity in the production process of the objects. For the solution of the proposed model, we used a column generation approach and a relax-and-fix heuristic. Computational tests were carried out in order to analyze the methodology used in the resolution of the model. The results showed to be competitive in a reasonable computational time.Sociedade Brasileira de Pesquisa Operacional2021-01-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382021000500402Pesquisa Operacional v.41 n.spe 2021reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/0101-7438.2021.041s1.00235094info:eu-repo/semantics/openAccessPierini,Livia MariaPoldi,Kelly Cristinaeng2021-06-08T00:00:00Zoai:scielo:S0101-74382021000500402Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2021-06-08T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false |
dc.title.none.fl_str_mv |
LOT SIZING AND CUTTING STOCK PROBLEMS IN A PAPER PRODUCTION PROCESS |
title |
LOT SIZING AND CUTTING STOCK PROBLEMS IN A PAPER PRODUCTION PROCESS |
spellingShingle |
LOT SIZING AND CUTTING STOCK PROBLEMS IN A PAPER PRODUCTION PROCESS Pierini,Livia Maria cutting stock problem lot sizing problem integrated Relax-and-Fix heuristic column generation paper industry |
title_short |
LOT SIZING AND CUTTING STOCK PROBLEMS IN A PAPER PRODUCTION PROCESS |
title_full |
LOT SIZING AND CUTTING STOCK PROBLEMS IN A PAPER PRODUCTION PROCESS |
title_fullStr |
LOT SIZING AND CUTTING STOCK PROBLEMS IN A PAPER PRODUCTION PROCESS |
title_full_unstemmed |
LOT SIZING AND CUTTING STOCK PROBLEMS IN A PAPER PRODUCTION PROCESS |
title_sort |
LOT SIZING AND CUTTING STOCK PROBLEMS IN A PAPER PRODUCTION PROCESS |
author |
Pierini,Livia Maria |
author_facet |
Pierini,Livia Maria Poldi,Kelly Cristina |
author_role |
author |
author2 |
Poldi,Kelly Cristina |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Pierini,Livia Maria Poldi,Kelly Cristina |
dc.subject.por.fl_str_mv |
cutting stock problem lot sizing problem integrated Relax-and-Fix heuristic column generation paper industry |
topic |
cutting stock problem lot sizing problem integrated Relax-and-Fix heuristic column generation paper industry |
description |
ABSTRACT In many manufacturing industries, the production process involves the production of objects and the cutting of such objects into smaller pieces in order to meet a specific demand. In the optimization of these processes, one can identify the lot sizing and the cutting stock problems. In the literature, these problems are mostly separately dealt. However, treating these two problems in an integrated approach can decrease overall costs. In this research, we deal with the coupled lot sizing and cutting stock problem. It is proposed a mathematical formulation for the production and cutting of paper based on a real case, which considers setup costs and limited machine capacity in the production process of the objects. For the solution of the proposed model, we used a column generation approach and a relax-and-fix heuristic. Computational tests were carried out in order to analyze the methodology used in the resolution of the model. The results showed to be competitive in a reasonable computational time. |
publishDate |
2021 |
dc.date.none.fl_str_mv |
2021-01-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382021000500402 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382021000500402 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/0101-7438.2021.041s1.00235094 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
text/html |
dc.publisher.none.fl_str_mv |
Sociedade Brasileira de Pesquisa Operacional |
publisher.none.fl_str_mv |
Sociedade Brasileira de Pesquisa Operacional |
dc.source.none.fl_str_mv |
Pesquisa Operacional v.41 n.spe 2021 reponame:Pesquisa operacional (Online) instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) instacron:SOBRAPO |
instname_str |
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) |
instacron_str |
SOBRAPO |
institution |
SOBRAPO |
reponame_str |
Pesquisa operacional (Online) |
collection |
Pesquisa operacional (Online) |
repository.name.fl_str_mv |
Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) |
repository.mail.fl_str_mv |
||sobrapo@sobrapo.org.br |
_version_ |
1750318018482667520 |