Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/237974
Type: Artigo
Title: Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
Author: Poldi, Kelly Cristina
Araujo, Silvio Alexandre de
Abstract: The multiperiod cutting stock problem arises in the production planning and programming of many industries that have the cutting process as an important stage. Ordered items are required in different periods of a finite planning horizon. It is possible to bring forward or not the production of items. Unused inventory in a certain period becomes available for the next period, all together with new inventory which may come to be acquired in the market. Based on mixed integer optimization models from the literature, extensions are proposed to deal with the multiperiod case and a residual heuristic is used. Computational experiments showed that effective gains can be obtained when comparing multiperiod models with the lot for lot solution, which is typically used in practice. Most of the instances are solved satisfactorily with a high performance optimization package and the heuristic method is used for solving the hard instances. © 2016 Springer Science+Business Media New York
The multiperiod cutting stock problem arises in the production planning and programming of many industries that have the cutting process as an important stage. Ordered items are required in different periods of a finite planning horizon. It is possible to bring forward or not the production of items. Unused inventory in a certain period becomes available for the next period, all together with new inventory which may come to be acquired in the market. Based on mixed integer optimization models from the literature, extensions are proposed to deal with the multiperiod case and a residual heuristic is used. Computational experiments showed that effective gains can be obtained when comparing multiperiod models with the lot for lot solution, which is typically used in practice. Most of the instances are solved satisfactorily with a high performance optimization package and the heuristic method is used for solving the hard instances.
Subject: Problema de corte de estoque
Modelos matemáticos
Programação não-linear inteira mista
Meta-heurística
Country: Estados Unidos
Editor: Springer
Citation: Annals Of Operations Research. Springer New York Llc, p. 1 - 24, 2016.
Rights: fechado
Identifier DOI: 10.1007/s10479-015-2103-2
Address: https://link.springer.com/article/10.1007/s10479-015-2103-2
Date Issue: 2016
Appears in Collections:IMECC - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
2-s2.0-84954552780.pdf567.96 kBAdobe PDFView/Open


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