Journal of Parallel and Distributed Computing
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Exact algorithms for the guillotine strip cutting/packing problem
Computers and Operations Research
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
A Review of the Application ofMeta-Heuristic Algorithms to 2D Strip Packing Problems
Artificial Intelligence Review
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
INFORMS Journal on Computing
The Three-Dimensional Bin Packing Problem
Operations Research
An Exact Approach to the Strip-Packing Problem
INFORMS Journal on Computing
Exhaustive approaches to 2D rectangular perfect packings
Information Processing Letters
A new heuristic recursive algorithm for the strip rectangular packing problem
Computers and Operations Research
Heuristic algorithm for a cutting stock problem in the steel bridge construction
Computers and Operations Research
A least wasted first heuristic algorithm for the rectangular packing problem
Computers and Operations Research
A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem
INFORMS Journal on Computing
A fast layer-based heuristic for non-guillotine strip packing
Expert Systems with Applications: An International Journal
The cutting stock problem recent application in information technology
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part II
Heuristic for the rectangular strip packing problem with rotation of items
Computers and Operations Research
INFORMS Journal on Computing
Hi-index | 0.01 |
A heuristic recursive algorithm for the two-dimensional rectangular strip packing problem is presented. It is based on a recursive structure combined with branch-and-bound techniques. Several lengths are tried to determine the minimal plate length to hold all the items. Initially the plate is taken as a block. For the current block considered, the algorithm selects an item, puts it at the bottom-left corner of the block, and divides the unoccupied region into two smaller blocks with an orthogonal cut. The dividing cut is vertical if the block width is equal to the plate width; otherwise it is horizontal. Both lower and upper bounds are used to prune unpromising branches. The computational results on a class of benchmark problems indicate that the algorithm performs better than several recently published algorithms.