Heuristics for the score-constrained strip-packing problem

Hawa, Asyl, Lewis, Rhyd and Thompson, Jonathan M. (2018) Heuristics for the score-constrained strip-packing problem. In, Combinatorial optimization and applications. (Lecture Notes in Computer Science, 11346) Springer, 449–462. (doi:10.1007/978-3-030-04651-4_30).

Record type: Book Section

Abstract

This paper investigates the Score-Constrained Strip-Packing Problem (SCSPP), a combinatorial optimisation problem that generalises the one-dimensional bin-packing problem. In the construction of cardboard boxes, rectangular items are packed onto strips to be scored by knives prior to being folded. The order and orientation of the items on the strips determine whether the knives are able to score the items correctly. Initially, we detail an exact polynomial-time algorithm for finding a feasible alignment of items on a single strip. We then integrate this algorithm with a packing heuristic to address the multi-strip problem and compare with two other greedy heuristics, discussing the circumstances in which each method is superior.

This record has no associated files available for download.