Desenvolvimento de alguns métodos de solução para o problema de redução de ciclos de serra / Development of some solution methods to the saw cycles reduction problem

AUTOR(ES)
DATA DE PUBLICAÇÃO

2009

RESUMO

In this work, the problem of reducing saw cycles is focused. This problem arises, for example, in cutting settings where the saw machine costs contributes significantly to production costs, and / or in a situation with high demand where the saw machine must be used efficiently, producing more items per unit of time. A new integer linear programming model is proposed for the problem and also new heuristics to solve it. The heuristics are based on the idea of producing cutting patterns that can be repeated several times, preferably in quantities that are multiples of the saw capacity, associated to an approximated resolution of an integer linear programming model. The model is solved using Column Generation and a rounding method of the solution. Computational tests, based on suggested instances by Foerster e Wäscher (1999), are presented to evaluate the performance of the proposed heuristics. The tests show that, for the majority of the cases, the heuristics reduce the number of saw cycles compared to the classic cutting stock problem solution when only the minimization of the number of objects defines the objective function, while maintaining a trade-off with the number of objects cut.

ASSUNTO(S)

redução de ciclos de serra problema de corte de estoque unidimensional geração de colunas otimização combinatória programação linear saw cycles reduction unidimensional cutting stock problem column generation combinatorial optimization linear programming

ACESSO AO ARTIGO

Documentos Relacionados