.png){kind=icon}
.png){kind=icon}
Return
Linear models for 1-group two-dimensional guillotine cutting problems
.png){kind=icon}
PRE
AI
DOI：10.1080/00207540500478603.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this study we present integer linear and non-linear models to generate 1-group constrained and unconstrained two-dimensional guillotine cutting patterns, including exact and non-exact cases. These patterns appear in different cutting processes as, for example, in the furniture industry. The models are useful for research and development of more effective solution methods, exploring particular structures, model decomposition, model relaxations, etc. They are also helpful for the performance evaluation of heuristic methods, since they allow (at least for problems of moderate size) an estimation of the optimality gap of heuristic solutions. To demonstrate the effectiveness of the proposed models, we compare them with models of the literature by solving a number of examples randomly generated and an actual example derived from a furniture company. Such results were produced using a well-known commercial software (the modelling language GAMS and the solver CPLEX) and they show that the computational efforts required to solve the models can be very different.
Keywords:
cutting and packing problems
1-group guillotine cutting
integer linear models
furniture industry
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
No organization information available