SciELO - Scientific Electronic Library Online

 
vol.3 número1Avaliando empiricamente o impacto da reengenharia de processos empresariais nas firmas de manufaturaGlobalização e capacitação tecnológica nos países de industrialização tardia: lições para o Brasil índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

Links relacionados

Compartilhar


Gestão & Produção

versão impressa ISSN 0104-530X

Resumo

CARVALHO, J.M. Valério de. Exact solution of one-dimensional cutting stock problems using branch-and-bound and column generation. Gest. Prod. [online]. 1996, vol.3, n.1, pp.33-48. ISSN 0104-530X.  https://doi.org/10.1590/S0104-530X1996000100002.

If an integer solution to the one-dimensional cutting stock problem is required, after solving the linear programming relaxation, one frequently resorts to heuristics based on rounding up and down the continuos solution, or other heuristics similar type. The difficulties arise from the fact that it may not be practically possible to enumerate all the structural variables of the problem, whose number may be in the order of millions, even for instances of moderate size. In this article we present a formulation with a number of variables and constraints that is polinomial with respect to the width of the stock and the number of orders. For some classes of instances, it is possible to enumerate completely all the variables and to obtain an integer optional solution using a branch-and-bound method. For larger instances, we present a procedure that combines column generation and branch-and-bound. We define the subproblem, and the way it is modified during the branch-and-bound phase. Computational results are presented for several test problems.

Palavras-chave : cutting stock; cutting problem; column generation.

        · resumo em Português     · texto em Português     · Português ( pdf )

 

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons