Optimal Two-Section Layouts for the Two-Dimensional Cutting Problem


Jun Ji, Dun-hua Huang, Fei-fei Xing, and Yao-dong Cui, Journal of Information Processing Systems Vol. 17, No. 2, pp. 271-283, Apr. 2021  

10.3745/JIPS.01.0066
Keywords: Cutting Stock Problem, Layout, Optimization, Two-Dimensional Cutting
Fulltext:

Abstract

When generating layout schemes, both the material usage and practicality of the cutting process should be considered. This paper presents a two-section algorithm for generating guillotine-cutting schemes of rectangular blanks. It simplifies the cutting process by allowing only one size of blanks to appear in any rectangular block. The algorithm uses an implicit enumeration and a linear programming optimal cutting scheme to maximize the material usage. The algorithm was tested on some benchmark problems in the literature, and compared with the three types of layout scheme algorithm. The experimental results show that the algorithm is effective both in computation time and in material usage.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
Jun Ji, Dun-hua Huang, Fei-fei Xing, & and Yao-dong Cui (2021). Optimal Two-Section Layouts for the Two-Dimensional Cutting Problem. Journal of Information Processing Systems, 17(2), 271-283. DOI: 10.3745/JIPS.01.0066.

[IEEE Style]
J. Ji, D. Huang, F. Xing and a. Y. Cui, "Optimal Two-Section Layouts for the Two-Dimensional Cutting Problem," Journal of Information Processing Systems, vol. 17, no. 2, pp. 271-283, 2021. DOI: 10.3745/JIPS.01.0066.

[ACM Style]
Jun Ji, Dun-hua Huang, Fei-fei Xing, and and Yao-dong Cui. 2021. Optimal Two-Section Layouts for the Two-Dimensional Cutting Problem. Journal of Information Processing Systems, 17, 2, (2021), 271-283. DOI: 10.3745/JIPS.01.0066.