Corpus ID: 236428340

A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers

@inproceedings{Birgin2021AFM,
  title={A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers},
  author={Ernesto G. Birgin and Oberlan Christo Romao and Debora Pretti Ronconi},
  year={2021}
}
In [E. G. Birgin, O. C. Romão, and D. P. Ronconi, The multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers, International Transactions in Operational Research 27(3), 1392–1418, 2020] the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers was introduced. At each decision instant, the problem consists in determining a cutting pattern for a set of ordered items using a set of objects that can be purchased or can be leftovers… Expand

References

SHOWING 1-10 OF 18 REFERENCES
The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers
TLDR
The mixed integer linear programming model for the two-dimensional non-guillotine cutting problem with usable leftovers is extended to the multiperiod framework and the decision at each instant aims to minimize the overall cost of the objects up to the considered time horizon. Expand
MIP models for two-dimensional non-guillotine cutting problems with usable leftovers
TLDR
This study uses multilevel mathematical programming models to represent the problem appropriately, which basically consists of cutting the ordered items using a set of objects of minimum cost, and choosing one that maximizes the value of the usable leftovers, and, among them, selecting one that minimizes the number of usableleftovers. Expand
Two-stage two-dimensional guillotine cutting stock problems with usable leftover
TLDR
Two bilevel mathematical programming models to represent this non-exact two-stage two-dimensional residual bin-packing problem are presented and, among all possible solutions of minimum cost, choosing one that maximizes the value of the generated usable leftovers is chosen. Expand
Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers
TLDR
This paper addresses the integration of the lot-sizing problem and the one-dimensional cutting stock problem with usable leftovers (LSP-CSPUL) and an approach, using the simplex method with column generation, is proposed to solve the linear relaxation of this model. Expand
The one-dimensional cutting stock problem with usable leftovers - A survey
In this article, we review published studies that consider the solution of the one-dimensional cutting stock problem (1DCSP) with the possibility of using leftovers to meet future demands, if longExpand
One-dimensional stock cutting: optimization of usable leftovers in consecutive orders
TLDR
The proposed method solves the problem of how to calculate the near optimal amount of UL in stock and how to control the stock and the computational results indicate that trim-loss in consecutive orders is reduced, and excessive growth ofUL in stock is prevented. Expand
Integrating two-dimensional cutting stock and lot-sizing problems
TLDR
An integrated problem, in which the 2DCSP is extended from the solution in only a single production planning period to a solution in a set of production planning periods, is considered, minimizing the total cost, which includes material, waste and storage costs. Expand
An integer programming model for two- and three-stage two-dimensional cutting stock problems
TLDR
An integer programming model for two-dimensional cutting stock problems is proposed, which can be seen as an extension of the "one-cut model" proposed by Dyckhoff for the one-dimensionalcutting stock problem. Expand
A New Linear Programming Approach to the Cutting Stock Problem
A new approach to the one-dimensional cutting stock problem is described and compared to the classical model for which Gilmore and Gomory have developed a special column-generation technique. The newExpand
Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches
TLDR
A mixed integer linear programming (MILP) model is developed for solving the present marble plane cutting problem for small-size instances and for larger size problem instances a Stochastic Diffusion Search (SDS) algorithm is developed. Expand
...
1
2
...