论文信息 - Improved Lower Bound for Online Strip Packing

Improved Lower Bound for Online Strip Packing

We study the online strip packing problem and derive an improved lower bound of ρ≥2.589… for the competitive ratio of this problem. The construction is based on modified “Brown-Baker-Katseff sequences” (Brown et al. in Acta Inform. 18:207–225, 1982) using only two types of rectangles. In addition, we present an online algorithm with competitive ratio $(3+\sqrt{5})/2 = 2.618\ldots$ for packing instances of this type.

Rolf Harren | Walter Kern

[1] Bernhard Fuchs,et al. Online Matching On a Line , 2003, Electron. Notes Discret. Math..

[2] Guochuan Zhang,et al. A note on online strip packing , 2009, J. Comb. Optim..

[3] Claire Mathieu,et al. Approximate strip packing , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[4] Berit Johannes,et al. Scheduling parallel jobs to minimize the makespan , 2006, J. Sched..

[5] Walter Kern,et al. A tight analysis of Brown-Baker-Katseff sequences for online strip packing , 2010, CTW.

[6] Brenda S. Baker,et al. Shelf Algorithms for Two-Dimensional Packing Problems , 1983, SIAM J. Comput..

[7] Johann Hurink,et al. Online Algorithm for Parallel Job Scheduling and Strip Packing , 2007, WAOA.

[8] Guochuan Zhang,et al. Strip Packing vs. Bin Packing , 2006, AAIM.

[9] Ronald L. Rivest,et al. Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[10] Gerhard J. Woeginger,et al. Shelf Algorithms for On-Line Strip Packing , 1997, Inf. Process. Lett..

[11] Brenda S. Baker,et al. Lower bounds for on-line two-dimensional packing algorithms , 1982, Acta Informatica.

[12] Johann Hurink,et al. Online scheduling of parallel jobs on two machines is 2-competitive , 2008, Oper. Res. Lett..

[13] Rolf Harren,et al. Improved Lower Bound for Online Strip Packing - (Extended Abstract) , 2011, WAOA.