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 ρ ≥ 3/2+√33/6 ≈ 2.457 for the competitive ratio of online strip packing.
展开▼
