EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2826. The cutting stock problem with limited open stacks
Invited abstract in session TA-7: Cutting and Packing 5 - related topics, stream Cutting and Packing (ESICUP).
Tuesday, 8:30-10:00Room: 1019 (building: 202)
Authors (first author is the speaker)
| 1. | Kelly Cristina Poldi
|
| Institute of Mathematics, Statistics and Scientific Computing (IMECC), University of Campinas (UNICAMP) | |
| 2. | Gabriel Gazzinelli Guimaraes
|
| Universidade Estadual de Campinas (UNICAMP) |
Abstract
A Cutting Stock Problem (CSP) consists of determining the best way in which a set of larger units (objects) should be cut in order to fulfill the demand for a set of smaller pieces (items) while minimizing a certain objective that can be, for instance, the number of objects or material waste. In industrial contexts, automatic cutting machines have a limited number of unloading stations and, thus, it is essential, in mathematical modeling, for accurate representation to consider these constraints added to the CSP. Such problem is known as the Cutting Stock with Limited Open Stacks Problem (CS-LOSP). In this research, we present an integer linear programming formulation for the CS-LOSP, and some computational experiments carried out on randomly generated instances.
Keywords
- Cutting and Packing
- Industrial Optimization
Status: accepted
Back to the list of papers