Improved lower bound for online strip packing

Authors:
Rolf Harren;Walter Kern
Affiliations:
Max-Planck-Institut für Informatik (MPII), Saarbrücken, Germany;Department of Applied Mathematics, University of Twente, Enschede, The Netherlands
Venue:
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Year:
2011

Citing 3
Cited 3

Scheduling parallel jobs to minimize the makespan

Journal of Scheduling
Online algorithm for parallel job scheduling and strip packing

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Online scheduling of parallel jobs on two machines is 2-competitive

Operations Research Letters

SIGACT news online algorithms column 20: the power of harmony

ACM SIGACT News
A tight analysis of Brown-Baker-Katseff sequences for online strip packing

Journal of Combinatorial Optimization
The generalization of scheduling with machine cost

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the two-dimensional strip packing problem a number of rectangles have to be packed without rotation or overlap into a strip such that the height of the strip used is minimal. The width of the rectangles is bounded by 1 and the strip haswidth 1 and infinite height.