A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
SIAM Journal on Computing
Online variable-sized bin packing
Discrete Applied Mathematics
On-line bin packing in linear time
Journal of Algorithms
An on-line algorithm for variable-sized bin packing
Acta Informatica
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
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Bounded space on-line variable-sized bin packing
Acta Cybernetica
New Algorithms for Bin Packing
Journal of the ACM (JACM)
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Fast algorithms for bin packing
Journal of Computer and System Sciences
On the Online Bin Packing Problem
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Removable Online Knapsack Problems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
| Hi-index | 0.00 |
An online algorithm for variable-sized bin packing, based on the HARMONIC algorithm of Lee and Lee [11], is investigated. This algorithm is based on one proposed by Csirik [4]. It is shown that the algorithm is optimal among those which use bounded space. An interesting feature of the analysis is that, although it is shown that our algorithm achieves a performance ratio arbitrarily close to the optimum value, it is not known precisely what that value is. The case where bins of capacity 1 and α ∈ (0, 1) are used is studied in greater detail. It is shown that among algorithms which are allowed to chose α, the optimal performance ratio lies in [1.37530, 1.37532].