A survey and comparison of heuristics for the 2D oriented on-line strip packing problem
The two dimensional oriented on-line strip packing problem requires items to be packed, one at a time, into a strip of fixed width and infinite height so as to minimise the total height of the packing. The items may neither be rotated nor overlap. In this paper, ten heuristics from the literature ar...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Operations Research Society of South Africa (ORSSA)
2008-12-01
|
| Series: | ORiON |
| Online Access: | http://orion.journals.ac.za/pub/article/view/65 |