Two-Dimensional On-Line Bin Packing Problem with Rotatable Items

Authors:
Satoshi Fujita;Takeshi Hada
Affiliations:
-;-
Venue:
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Year:
2000

Citing 4
Cited 1

A simple on-line bin-packing algorithm

Journal of the ACM (JACM)
Improved bounds for harmonic-based bin packing algorithms

Discrete Applied Mathematics - Special volume: combinatorics and theoretical computer science
An improved lower bound for on-line bin packing algorithms

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

On-Line Grid-Packing with a Single Active Grid

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a two-dimensional version of the on-line bin packing problem, in which each rectangular item that should be packed into unit square bins is "rotatable" by 90 degrees. An on-line algorithm that uses an unbounded number of active bins is proposed. The worst case ratio of the algorithm is at least 2.25 and at most 2.565.