Static job scheduling in partitionable mesh connected systems
Journal of Parallel and Distributed Computing
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
SIAM Journal on Computing
A lower bound for the non-oriented two-dimensional bin packing problem
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Two-dimensional on-line bin packing problem with rotatable items
Theoretical Computer Science
Packing 2-Dimensional Bins in Harmony
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Approximation schemes for multidimensional packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
New approximability and inapproximability results for 2-dimensional Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal online bounded space multidimensional packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Three-dimensional packings with rotations
Computers and Operations Research
| Hi-index | 0.00 |
We consider two- and three-dimensional bin-packing problems where 90° rotations are allowed. We improve all known asymptotic performance bounds for these problems. In particular, we show how to combine ideas from strip packing and two-dimensional bin packing to give a new algorithm for the three-dimensional strip packing problem where boxes can only be rotated sideways. We propose to call this problem “This side up”. Our algorithm has an asymptotic performance bound of 9/4.