Two-dimensional rectangle packing: on-line methods and results
Discrete Applied Mathematics - ARIDAM IV and V
Dynamic scheduling on parallel machines
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Scheduling Parallel Machines On-line
SIAM Journal on Computing
Journal of Algorithms
Shelf algorithms for on-line strip packing
Information Processing Letters
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Multidimensional on-line bin packing: Algorithms and worst-case analysis
Operations Research Letters
Offline and online aspects of defragmenting the module layout of a partially reconfigurable device
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An on-line algorithm for the rectangle packing problem with rejection
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
On-line scheduling of multi-core processor tasks with virtualization
Operations Research Letters
The generalization of scheduling with machine cost
Theoretical Computer Science
| Hi-index | 0.00 |
In the strip packing problem the goal is to pack a set of rectangles into a vertical strip so as to minimize the total height of the strip needed. We consider a modified version of the strip packing problem. In this version it is allowed to change the form of the rectangles by lengthening them, keeping the area fixed. We introduce online algorithms to solve this modified problem. Moreover a lower bound is presented, as well.