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

Authors:
W. Kern;J. J. Paulus
Affiliations:
, Enschede, The Netherlands;CQM BV, Eindhoven, The Netherlands 5600 AK
Venue:
Journal of Combinatorial Optimization
Year:
2013

Citing 5
Cited 1

Scheduling parallel jobs to minimize the makespan

Journal of Scheduling
Online matching on a line

Theoretical Computer Science
Online algorithm for parallel job scheduling and strip packing

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Improved lower bound for online strip packing

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Online scheduling of parallel jobs on two machines is 2-competitive

Operations Research Letters

The generalization of scheduling with machine cost

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study certain adversary sequences for online strip packing which were first designed and investigated by Brown, Baker and Katseff (Acta Inform. 18:207---225) and determine the optimal competitive ratio for packing such Brown-Baker-Katseff sequences online. As a byproduct of our result, we get a new lower bound of $\rho \ge 3/2+\sqrt{33}/6 \approx 2.457$ for the competitive ratio of online strip packing.