| Texto completo | |
| Autor(es): |
Silva, Everton Fernandes
[1]
;
Oliveira, Larissa Tebaldi
[1]
;
Oliveira, Jose Fernando
[2]
;
Bragion Toledo, Franklina Maria
[1]
Número total de Autores: 4
|
| Afiliação do(s) autor(es): | [1] Univ Sao Paulo, Inst Ciencias Matemat & Comp, Ave Trabalhador Sao Carlense, BR-13560970 Sao Carlos, SP - Brazil
[2] Univ Porto, Fac Engn, INESC TEC, Rua Dr Roberto Frias, P-4200465 Porto - Portugal
Número total de Afiliações: 2
|
| Tipo de documento: | Artigo Científico |
| Fonte: | Computers & Operations Research; v. 112, DEC 2019. |
| Citações Web of Science: | 0 |
| Resumo | |
Cutting phases occur in many production processes when a larger object must be cut into multiple smaller pieces. Some examples of relevant industries being clothing, footwear, metalware and furniture. The cutting phase is composed of two stages. The first stage consists of finding a good layout for the set of small pieces that must be cut from the larger object and minimizing some objective such as raw-material waste (The Cutting and Packing Problem). Once this good layout has been established, it is provided as input for the second stage which consists of determining the path to cut the pieces which minimizes another objective, such as the total cutting time or distance (The Cutting Path Determination Problem). This second stage is crucial for efficient production planning. Only one linear mathematical model has previously been proposed for the Cutting Path Determination Problem. In this paper, this problem is addressed using two exact approaches based on the Rural Postman Problem (RPP) and the Traveling Salesman Problem (TSP). The RPP approach, in particular, is able to produce optimal solutions for instances containing more than 2000 edges in under 1 h. (C) 2019 Elsevier Ltd. All rights reserved. (AU) | |
| Processo FAPESP: | 15/09109-0 - O problema de caminho de corte |
| Beneficiário: | Everton Fernandes da Silva |
| Modalidade de apoio: | Bolsas no Exterior - Estágio de Pesquisa - Mestrado |
| 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: | 13/25743-6 - Uma integração dos problemas de empacotamento de peças irregulares e do caminho mínimo de corte |
| Beneficiário: | Larissa Tebaldi de Oliveira |
| Modalidade de apoio: | Bolsas no Brasil - Doutorado |
| Processo FAPESP: | 16/09476-6 - Métodos de resolução para o problema integrado de empacotamento de peças irregulares e caminho mínimo de corte |
| Beneficiário: | Larissa Tebaldi de Oliveira |
| Modalidade de apoio: | Bolsas no Exterior - Estágio de Pesquisa - Doutorado |
| Processo FAPESP: | 13/27162-0 - Modelos matemáticos para um problema de caminho de corte |
| Beneficiário: | Everton Fernandes da Silva |
| Modalidade de apoio: | Bolsas no Brasil - Mestrado |