A Strip-Packing Algorithm with Absolute Performance Bound 2
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
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
An asymptotic approximation algorithm for 3D-strip packing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Harmonic algorithm for 3-dimensional strip packing problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On-Line Multiple-Strip Packing
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Two for One: Tight Approximation of 2D Bin Packing
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Two level job-scheduling strategies for a computational grid
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Analysis of multi-organization scheduling algorithms
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
A fast 5/2-approximation algorithm for hierarchical scheduling
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Scheduling jobs on heterogeneous platforms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Approximation Algorithms for Scheduling Parallel Jobs
SIAM Journal on Computing
On-Line scheduling of parallel jobs in heterogeneous multiple clusters
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Coordination mechanisms for selfish parallel jobs scheduling
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Hybrid approach for 2d strip packing problem using genetic algorithm
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advances in computational intelligence - Volume Part I
| Hi-index | 0.00 |
In this paper we study the Multiple Strip Packing (MSP) problem, a generalization of the well-known Strip Packing problem. For a given set of rectangles, r1,...,rn, with heights and widths ≤1, the goal is to find a non-overlapping orthogonal packing without rotations into k∈ℕ strips [0,1]×[0,∞), minimizing the maximum of the heights. We present an approximation algorithm with absolute ratio 2, which is the best possible, unless ${\cal P}={\cal NP}$, and an improvement of the previous best result with ratio 2+ε. Furthermore we present simple shelf-based algorithms with short running-time and an AFPTAS for MSP. Since MSP is strongly ${\cal NP}$-hard, an FPTAS is ruled out and an AFPTAS is also the best possible result in the sense of approximation theory.