A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem

References

• Alvarez-Valdes R., Parreño F., Tamarit J. M. Reactive GRASP for the strip-packing problem. Comput. Oper. Res. (2008) 35(4):1065–1083Crossref, Google Scholar
• Baker B. S., Coffman E. G., Rivest R. L. Orthogonal packings in two dimensions. SIAM J. Comput. (1980) 9(4):846–855Crossref, Google Scholar
• Bennell J. A., Oliveira J. F. The geometry of nesting problems: A tutorial. Eur. J. Oper. Res. (2006) 184(2):397–415Crossref, Google Scholar
• Błażewicz J., Hawryluk P., Walkowiak R. Using a tabu search approach for solving two-dimensional irregular cutting problem. Ann. Oper. Res. (1993) 41(4):313–325Crossref, Google Scholar
• Bortfeldt A. A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Eur. J. Oper. Res. (2006) 172(3):814–837Crossref, Google Scholar
• Burke E. K., Kendall G., Whitwell G. A new placement heuristic for the orthogonal stock-cutting problem. Oper. Res. (2004) 52(4):655–671Link, Google Scholar
• Burke E. K., Kendall G., Whitwell G. A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem. INFORMS J. Comput. (2009) 21(3):505–516Link, Google Scholar
• Cui Y., Yang Y., Cheng X., Song P. A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem. Comput. Oper. Res. (2008) 35(4):1281–1291Crossref, Google Scholar
• Dagli C. H., Poshyanonda P. New approaches to nesting rectangular patterns. J. Intelligent Manufacturing (1997) 8(3):177–190Crossref, Google Scholar
• Dyckhoff H. A typology of cutting and packing problems. Eur. J. Oper. Res. (1990) 44(2):145–159Crossref, Google Scholar
• Faina L. An application of simulated annealing to the cutting stock problem. Eur. J. Oper. Res. (1999) 114(3):542–556Crossref, Google Scholar
• Gilmore P. C., Gomory R. E. A linear programming approach to the cutting-stock problem. Oper. Res. (1961) 9(6):849–859Link, Google Scholar
• Gilmore P. C., Gomory R. E. The theory and computation of knapsack functions. Oper. Res. (1966) 14(6):1045–1074Link, Google Scholar
• Hifi M. An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock. Comput. Oper. Res. (1997) 24(8):727–736Crossref, Google Scholar
• Hifi M. Exact algorithms for the guillotine strip cutting/packing problem. Comput. Oper. Res. (1998) 25(11):925–940Crossref, Google Scholar
• Hochbaum D. S., Maass W. Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM (1985) 32(1):130–136Crossref, Google Scholar
• Hopper E., Turton B. A genetic algorithm for a 2D industrial packing problem. Comput. Indust. Engrg. (1999) 37(1–2):375–378Crossref, Google Scholar
• Hopper E., Turton B. C. H. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur. J. Oper. Res. (2000) 128(1):34–57Crossref, Google Scholar
• Hopper E., Turton B. C. H. A review of the application of meta-heuristic algorithms to 2D strip packing problems. Artificial Intelligence Rev. (2001) 16(4):257–300Crossref, Google Scholar
• Hwang S.-M., Kao C.-Y., Horng J.-T. On solving rectangle bin packing problems using genetic algorithms. Proc. 1994 IEEE Internat. Conf. Systems, Man Cybernetics (1994) 2(IEEE, Washington, DC) 1583–1590Crossref, Google Scholar
• Jakobs S. On genetic algorithms for the packing of polygons. Eur. J. Oper. Res. (1996) 88(1):165–181Crossref, Google Scholar
• Kröger B. Guillontineable bin packing: A genetic approach. Eur. J. Oper. Res. (1995) 84(3):645–661Crossref, Google Scholar
• Leung T. W., Yung C. H., Trout M. D. Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem. Comput. Indust. Engrg. (2001) 40(3):201–214Crossref, Google Scholar
• Leung J. Y.-T., Tam T. W., Wong C. S., Young G. H., Chin F. Y. L. Packing squares into a square. J. Parallel Distrib. Comput. (1990) 10(3):271–275Crossref, Google Scholar
• Liu D., Teng H. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. Eur. J. Oper. Res. (1999) 112(2):413–419Crossref, Google Scholar
• Lodi A., Martello S., Monaci M. Two-dimensional packing problems: A survey. Eur. J. Oper. Res. (2002) 141(2):241–252Crossref, Google Scholar
• Martello S., Monaci M., Vigo D. An exact approach to the strip-packing problem. INFORMS J. Comput. (2003) 15(3):310–319Link, Google Scholar
• Smith D. Bin packing with adaptive search. Proc. First Internat. Conf. Genetic Algorithms (1985) (Lawrence Erlbaum Associates, Mahwah, NJ) 202–207Google Scholar
• Viswanathan K. V., Bagchi A. Best-first search methods for constrained two-dimensional cutting stock problems. Oper. Res. (1993) 41(4):768–776Link, Google Scholar
• Wang P. Y. Two algorithms for constrained two-dimensional cutting stock problems. Oper. Res. (1983) 31(3):573–586Link, Google Scholar
• Wäscher G., Haußner H., Schumann H. An improved typology of cutting and packing problems. Eur. J. Oper. Res. (2007) 183(3):1109–1130Crossref, Google Scholar
• Zhang D., Kang Y., Deng A. A new heuristic recursive algorithm for the strip rectangular packing problem. Comput. Oper. Res. (2006) 33(8):2209–2217Crossref, Google Scholar