| Full text | |
| Author(s): |
Martin, Mateus
;
Yanasse, Horacio Hideki
;
Santos, Maristela O.
;
Morabito, Reinaldo
Total Authors: 4
|
| Document type: | Journal article |
| Source: | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH; v. N/A, p. 22-pg., 2022-05-12. |
| Abstract | |
We address three variants of the two-dimensional cutting stock problem in which the guillotine cutting of large objects produces a set of demanded items. The characteristics of the variants are the rectangular shape of the objects and items; the number of two or three orthogonal guillotine stages; and a sequencing constraint that limits the number of open stacks to a scalar associated with the number of automatic compartments or available space near the cutting machine. These problems arise in manufacturing environments that seek minimum waste solutions with limited levels of work-in-process. Despite their practical relevance, we are not aware of mathematical models for them. In this paper, we propose an integer linear programming (ILP) formulation for each of these variants based on modelling strategies for the two-dimensional guillotine cutting stock problem and the minimisation of the open stacks problem. The first two variants deal with exact and non-exact 2-stage patterns, and the third with a specific type of 3-stage patterns. Using a general-purpose ILP solver, we performed computational experiments to evaluate these approaches with benchmark instances. The results show that several equivalent solutions of the cutting problem allow obtaining satisfactory solutions with a reduced number of open stacks. (AU) | |
| 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: | 20/00747-2 - New formulations for the minimization open stacks problems and related |
| Grantee: | Mateus Pereira Martin |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings |
| Grantee: | Reinaldo Morabito Neto |
| Support Opportunities: | Research Projects - Thematic Grants |