This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2026-232519
If you've NEVER registered a DOI in your Lattes, check our tutorial!In this paper, we address the two-dimensional single large object placement problem under guillotine cutting constraints for large objects with convex polygonal geometry. Rectangular items are cut from the object according to a two-stage guillotine cutting pattern with orthogonal rotations allowed. We also consider an extension with a defective region from which no items may be extracted. To solve the problem, we adopt a recursive dynamic programming algorithm capable of handling the geometric features of these shapes, including variable cut lengths. In addition, we propose a procedure to determine the initial angle of the cutting pattern in order to improve material utilization. Computational experiments show that the proposed approach yields effective and robust solutions, even in the presence of a defective region.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper