A new lower bound for online strip packing
From MaRDI portal
Publication:322552
DOI10.1016/j.ejor.2015.10.012zbMath1346.90724OpenAlexW2189948397MaRDI QIDQ322552
Guosong Yu, Yanling Mao, Jiaoliao Xiao
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.10.012
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)
Related Items (4)
Unnamed Item ⋮ A new upper bound for the online square packing problem in a strip ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Online scheduling of moldable parallel tasks
Cites Work
- A \((5/3+\varepsilon)\)-approximation for strip packing
- Online multiple-strip packing
- Scheduling parallel jobs to minimize the makespan
- Online scheduling of parallel jobs on two machines is 2-competitive
- A note on online strip packing
- A 2.5 times optimal algorithm for packing in two dimensions
- Lower bounds for on-line two-dimensional packing algorithms
- Improved lower bound for online strip packing
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- Approximation Algorithms for Multiple Strip Packing
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
- Shelf Algorithms for Two-Dimensional Packing Problems
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Online Algorithm for Parallel Job Scheduling and Strip Packing
- Approximate algorithms to pack rectangles into several strips
This page was built for publication: A new lower bound for online strip packing
