| Full text | |
| Author(s): |
Silva, Eduardo M.
;
Melega, Gislaine M.
;
Akartunali, Kerem
;
de Araujo, Silvio A.
Total Authors: 4
|
| Document type: | Journal article |
| Source: | European Journal of Operational Research; v. 304, n. 2, p. 18-pg., 2023-01-16. |
| Abstract | |
In this paper, we study the one-dimensional multi-period cutting stock problem with setup costs on cut-ting patterns. We present pattern-based and pseudo-polynomial formulations for the problem. Reformu-lations are also proposed to improve the lower bounds. We then present a thorough theoretical analysis to establish the strength of the various proposed formulations in comparison to each other. Finally, a computational analysis is conducted to complement the theoretical analysis and provide further insights with respect to the complexity and strength of the formulations.(c) 2022 Elsevier B.V. All rights reserved. (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: | 18/19893-9 - Integrated lot-sizing and cutting stock problems |
| Grantee: | Gislaine Mara Melega |
| 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 |