Two-dimensional on-line bin packing problem with rotatable items

Authors:
Satoshi Fujita;Takeshi Hada
Affiliations:
Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Higashi-Hiroshima 739-8527, Japan;Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Higashi-Hiroshima 739-8527, Japan
Venue:
Theoretical Computer Science
Year:
2002

Citing 4
Cited 5

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

This side up!

ACM Transactions on Algorithms (TALG)
Using genetic algorithms to solve quality-related bin packing problem

Robotics and Computer-Integrated Manufacturing
A decision support system for luggage typesetting

Expert Systems with Applications: An International Journal
Two-dimensional online bin packing with rotation

Theoretical Computer Science
This side up!

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms

Quantified Score

Hi-index	5.23

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°. Two on-line algorithms for solving the problem are proposed. The second algorithm is an extension of the first algorithms, and the worst-case ratio of the second one is at least 2.25 and at most 2.565.