Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size

@article{DellOlmo1999ApproximationAF,
  title={Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size},
  author={Paolo Dell'Olmo and Maria Grazia Speranza},
  journal={Discrete Applied Mathematics},
  year={1999},
  volume={94},
  pages={181-191}
}
A set of items has to be assigned to a set of bins with different sizes. If necessary the size of each bin can be extended. The objective is to minimize the total size, i.e. the sum of the sixs of the bins. In this paper we study both the oll-line case and the on-line variant of this problem under the assumption that each item is smaller than any bin. For the rurmer case, when all times arc known in advance, we analyze the worst-case performance of the longest processing time heuristic and… CONTINUE READING

References

Publications referenced by this paper.

Analysis of a hybrid algorithm for packing unequal bins

D. K. Friescn. F. S. Kuhl
SIAM J . • 1988