Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Theory and Algorithms
High Multiplicity Strip Packing Problem With Three Rectangle Types, Andy Yu
High Multiplicity Strip Packing Problem With Three Rectangle Types, Andy Yu
Electronic Thesis and Dissertation Repository
The two-dimensional strip packing problem (2D-SPP) involves packing a set R = {r1, ..., rn} of n rectangular items into a strip of width 1 and unbounded height, where each rectangular item ri has width 0 < wi ≤ 1 and height 0 < hi ≤ 1. The objective is to find a packing for all these items, without overlaps or rotations, that minimizes the total height of the strip used. 2D-SPP is strongly NP-hard and has practical applications including stock cutting, scheduling, and reducing peak power demand in smart-grids.
This thesis considers …