| Full text | |
| Author(s): |
Silva, Everton Fernandes
[1]
;
Oliveira, Larissa Tebaldi
[1]
;
Oliveira, Jose Fernando
[2]
;
Bragion Toledo, Franklina Maria
[1]
Total Authors: 4
|
| Affiliation: | [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
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | Computers & Operations Research; v. 112, DEC 2019. |
| Web of Science Citations: | 0 |
| Abstract | |
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) | |
| FAPESP's process: | 15/09109-0 - The cutting path problem |
| Grantee: | Everton Fernandes da Silva |
| Support Opportunities: | Scholarships abroad - Research Internship - Master's degree |
| FAPESP's process: | 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry |
| Grantee: | Francisco Louzada Neto |
| Support Opportunities: | Research Grants - Research, Innovation and Dissemination Centers - RIDC |
| FAPESP's process: | 13/25743-6 - Integrating nesting and cutting path determination problems |
| Grantee: | Larissa Tebaldi de Oliveira |
| Support Opportunities: | Scholarships in Brazil - Doctorate |
| FAPESP's process: | 16/09476-6 - Methods for the irregular packing and cutting path integrated models |
| Grantee: | Larissa Tebaldi de Oliveira |
| Support Opportunities: | Scholarships abroad - Research Internship - Doctorate |
| FAPESP's process: | 13/27162-0 - Mathematic models to a cutting path determination problem |
| Grantee: | Everton Fernandes da Silva |
| Support Opportunities: | Scholarships in Brazil - Master |