Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers

Full text
Author(s):
Birgin, E. G. [1] ; Romao, O. C. [1] ; Ronconi, D. P. [2]
Total Authors: 3
Affiliation:
[1] Univ Sao Paulo, Inst Math & Stat, Dept Comp Sci, Rua Matao 100, Cidade Univ, BR-05508090 Sao Paulo - Brazil
[2] Univ Sao Paulo, EP USP, Dept Prod Engn, Ave Prof Almeida Prado 128, Cidade Univ, BR-05508900 Sao Paulo - Brazil
Total Affiliations: 2
Document type: Journal article
Source: International Transactions in Operational Research; v. 27, n. 3, p. 1392-1418, MAY 2020.
Web of Science Citations: 2
Abstract

A mixed integer linear programing model for the two-dimensional non-guillotine cutting problem with usable leftovers was recently introduced by Andrade et al. The problem consists in cutting a set of ordered items using a set of objects of minimum cost and, within the set of solutions of minimum cost, maximizing the value of the usable leftovers. Since the concept of usable leftovers assumes they can potentially be used to attend new arriving orders, the problem is extended to the multiperiod framework in this work. In this way, the decision at each instant does not minimize in a myopic way the cost of the objects required to attend the orders of the current instant; but it aims to minimize the overall cost of the objects up to the considered time horizon. Some variants of the proposed model are analyzed and numerical results are presented. (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: 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
FAPESP's process: 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science
Grantee:Carlos Eduardo Ferreira
Support Opportunities: Research Projects - Thematic Grants