A heuristic algorithm for the non-oriented 2D rectangular strip packing problem

In this paper, we construct best fit based on concave corner strategy ($BF_{BCC}$) for the two-dimensional rectangular strip packing problem (2D-RSPP), and compare it with some heuristic and metaheuristic algorithms from the literature. The experimental results show that $BF_{BCC}$ could produce satisfied packing layouts, especially for the large problem of 50 pieces or more, $BF_{BCC}$ could get better results in shorter time.