| Texto completo | |
| Autor(es): |
Martin, Mateus
[1, 2]
;
Oliveira, Jose Fernando
[3, 2]
;
Silva, Elsa
[2]
;
Morabito, Reinaldo
[1]
;
Munari, Pedro
[1]
Número total de Autores: 5
|
| Afiliação do(s) autor(es): | [1] Univ Fed Sao Carlos, Dept Prod Engn, Sao Carlos - Brazil
[2] INESC TEC, Porto - Portugal
[3] Univ Porto, Fac Engn, Porto - Portugal
Número total de Afiliações: 3
|
| Tipo de documento: | Artigo Científico |
| Fonte: | EXPERT SYSTEMS WITH APPLICATIONS; v. 168, APR 15 2021. |
| Citações Web of Science: | 0 |
| Resumo | |
In this paper, we address the Constrained Three-dimensional Guillotine Cutting Problem (C3GCP), which consists of cutting a larger cuboid block (object) to produce a limited number of smaller cuboid pieces (items) using orthogonal guillotine cuts only. This way, all cuts must be parallel to the object's walls and generate two cuboid sub-blocks, and there is a maximum number of copies that can be manufactured for each item type. The C3GCP arises in industrial manufacturing settings, such as the cutting of steel and foam for mattresses. To model this problem, we propose a new compact mixed-integer non-linear programming (MINLP) formulation by extending its two-dimensional version, and develop a mixed-integer linear programming (MILP) version. We also propose a new model for a particular case of the problem which considers 3-staged patterns. As a solution method, we extend the algorithm of Wang (1983) to the three-dimensional case. We emphasise that the C3GCP is different from 3D packing problems, namely from the Container Loading Problem, because of the guillotine cut constraints. All proposed approaches are evaluated through computational experiments using benchmark instances. The results show that the approaches are effective on different types of instances, mainly when the maximum number of copies per item type is small, a situation typically encountered in practical settings with low demand for each item type. These approaches can be easily embedded into existing expert systems for supporting the decision-making process. (AU) | |
| Processo FAPESP: | 13/07375-0 - CeMEAI - Centro de Ciências Matemáticas Aplicadas à Indústria |
| Beneficiário: | Francisco Louzada Neto |
| Modalidade de apoio: | Auxílio à Pesquisa - Centros de Pesquisa, Inovação e Difusão - CEPIDs |
| Processo FAPESP: | 16/01860-1 - Problemas de corte, empacotamento, dimensionamento de lotes, programação da produção, roteamento, localização e suas integrações em contextos industriais e logísticos |
| Beneficiário: | Reinaldo Morabito Neto |
| Modalidade de apoio: | Auxílio à Pesquisa - Temático |
| Processo FAPESP: | 16/08039-1 - Problemas de Corte Bidimensional Guilhotinado e Restrito: Formulações Matemáticas e Métodos de Solução |
| Beneficiário: | Mateus Pereira Martin |
| Modalidade de apoio: | Bolsas no Brasil - Doutorado |