Static job scheduling in partitionable mesh connected systems
Journal of Parallel and Distributed Computing
SIAM Journal on Computing
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
SIAM Journal on Computing
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
Packing 2-Dimensional Bins in Harmony
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Theoretical Computer Science - Latin American theoretical informatics
New approximability and inapproximability results for 2-dimensional Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On strip packing With rotations
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
An asymptotic approximation algorithm for 3D-strip packing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ACM Transactions on Algorithms (TALG)
Two- and three-dimensional parametric packing
Computers and Operations Research
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research
Harmonic algorithm for 3-dimensional strip packing problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An on-line algorithm for multidimensional bin packing
Operations Research Letters
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing
Computers and Operations Research
| Hi-index | 0.01 |
We present approximation algorithms for the three-dimensional strip packing problem, and the three-dimensional bin packing problem. We consider orthogonal packings where 90^@? rotations are allowed. The algorithms we show for these problems have asymptotic performance bounds 2.64, and 4.89, respectively. These algorithms are for the more general case in which the bounded dimensions of the bin given in the input are not necessarily equal (that is, we consider bins for which the length, the width and the height are not necessarily equal). Moreover, we show that these problems-in the general version-are as hard to approximate as the corresponding oriented version.