Online Strip Packing with Polynomial Migration

We consider the relaxed online strip packing problem: Rectangular items arrive online and have to be packed without rotations into a strip of fixed width such that the packing height is minimized. Thereby, repacking of previously packed items is allowed. The amount of repacking is measured by the mi...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2018-02
Main Authors: Jansen, Klaus, Kim-Manuel, Klein, Kosche, Maria, Ladewig, Leon
Format: Article
Language:English
Subjects:
Algorithms
Asymptotic properties
Migration
Packaging
Polynomials
Strip
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider the relaxed online strip packing problem: Rectangular items arrive online and have to be packed without rotations into a strip of fixed width such that the packing height is minimized. Thereby, repacking of previously packed items is allowed. The amount of repacking is measured by the migration factor, defined as the total size of repacked items divided by the size of the arriving item. First, we show that no algorithm with constant migration factor can produce solutions with asymptotic ratio better than 4/3. Against this background, we allow amortized migration, i.e. to save migration for a later time step. As a main result, we present an AFPTAS with asymptotic ratio \(1 + \mathcal{O}(\epsilon)\) for any \(\epsilon > 0\) and amortized migration factor polynomial in \(1 / \epsilon\). To our best knowledge, this is the first algorithm for online strip packing considered in a repacking model.
ISSN:2331-8422