Abstract
This paper presents an algorithm for unconstrained T-shape homogenous block cutting patterns of rectangular pieces. A vertical cut divides the stock sheet into two segments. Each segment consists of sections that have the same length and direction. A section contains a row of homogenous blocks. A homogenous block consists of homogenous strips of the same piece type. Each cut on the block produces just one strip. The directions of two strips cut successively from a block are either parallel or orthogonal. The algorithm uses a dynamic programming recursion to generate optimal blocks, solves knapsack problems to obtain the block layouts on the sections and the section layout on segments of various lengths, and optimally selects two segments to compose the cutting pattern. The computational results indicate that the algorithm is efficient in improving material usage, and the computation time is reasonable.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cui Y. and Zhang X. (2007). Two-stage general block patterns for the two-dimensional cutting problem. Comput. Oper. Res. 34: 2882–2893
Seong G.G. and Kang M.K. (2003). A best-first branch and bound algorithm for unconstrained two- dimensional cutting problems. Oper. Res. Lett. 31: 301–307
Hifi M. and Zissimopoulos V. (1996). A recursive exact algorithm for weighted two-dimensional cutting. Eur. J. Oper. Res. 91: 553–564
Hifi M. (2001). Exact algorithms for large-scale unconstrained two and three staged cutting problems. Comput. Optim. Appl. 18: 63–88
Gilmore P.C. and Gomory R.E. (1965). Multistage cutting problems of two and more dimensions. Oper. Res. 13: 94–119
Beasley J.E. (1985). Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. 36: 297–306
Cui Y., Wang Z. and Li J. (2005). Exact and heuristic algorithms for staged cutting problems. J. Eng. Manufacture 219(B2): 201–208
Cui Y. (2004). Generating optimal T-shape cutting patterns for rectangular blanks. J. Eng. Manufacture 218: 857–866
Agrawal P.K. (1993). Minimizing trim loss in cutting rectangular blanks of a single size form a rectangular sheet using orthogonal guillotine cuts. Eur. J. Oper. Res. 64: 410–422
Tarnowski A.G., Terno J. and Scheithauer G. (1994). A polynomial time algorithm for the guillotine pallet-loading problem. INFOR 32: 275–287
Arslanov M.Z. (2000). Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles. Eur. J. Oper. Res. 125: 239–248
Cui Y. and Zhou R. (2002). Generating optimal cutting patterns for rectangular blanks of a single size. J. Oper. Res. Soc. 53: 1338–1346
Cui Y. (2005). Dynamic programming algorithms for the optimal cutting of equal rectangles. Appl. Math. Model. 29: 1040–1053
Kellerer H., Pferschy U. and Pisinger D. (2004). Knapsack Problems. Springer, Berlin
Cui Y., He D. and Song X. (2006). Generating optimal two-section cutting patterns for rectangular blanks. Comput. Oper. Res. 33: 1505–1520
Fayard D., Hifi M. and Zissimopoulos V. (1998). An efficient approach for large-scale two-dimensional guillotine cutting stock problems. J. Oper. Res. Soc. 49: 1270–1277
Alvarez-Valdes R., Parajon A. and Tamarit J.M. (2002). A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Comput. Oper. Res. 29: 925–947
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cui, Y., Liu, Z. T-shape homogenous block patterns for the two-dimensional cutting problem. J Glob Optim 41, 267–281 (2008). https://doi.org/10.1007/s10898-007-9252-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-007-9252-z