A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem

An overview and comparison is provided of a number of heuristics from the literature for the two-dimensional strip packing problem in which rectangles have to be packed without rotation. Heuristics producing only guillotine packings are considered. A new heuristic is also introduced and a number of modifications are suggested to the existing heuristics. The resulting heuristics (known and new) are then compared statistically with respect to a large set of known benchmarks at a 5% level of significance.