Advertisement

Fair versus Unrestricted Bin Packing

  • Yossi Azar
  • Joan Boyar
  • Lene M. Favrholdt
  • Kim S. Larsen
  • Morten N. Nielsen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1851)

Abstract

We consider the Unrestricted Bin Packing problem where we have bins of equal size and a sequence of items. The goal is to maximize the number of items that are packed in the bins by an on-line algorithm. We investigate the power of performing admission control on the items, i.e., rejecting items while there is enough space to pack them, versus behaving fairly, i.e., rejecting an item only when there is not enough space to pack it. We show that by performing admission control on the items, we get better performance for various measures compared with the performance achieved on the fair version of the problem. Our main result shows that we can pack 2/3 of the items for sequences in which the optimal can pack all the items.

Keywords

Competitive Ratio Online Algorithm Large Item Small Item Request Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-Competitive On-Line Routing. In 34th IEEE Symposium on Foundations of Computer Science, pages 32–40, 1993.Google Scholar
  2. 2.
    B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén. Competitive Non-Preemptive Call Control. In Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 312–320, 1994.Google Scholar
  3. 3.
    B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani. On-line Admission Control and Circuit Routing for High Performance Computation and Communication. In 35th IEEE Symposium on Foundations of Computer Science, pages 412–423, 1994.Google Scholar
  4. 4.
    J. Boyar and K. S. Larsen. The Seat Reservation Problem. Algorithmica, 25:403–417, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    J. Boyar, K. S. Larsen, and M. N. Nielsen. The Accommodating Function — A Generalization of the Competitive Ratio. Tech. report 24, Department of Mathematics and Computer Science, University of Southern Denmark, Main Campus: Odense University, 1998. Extended version submitted for journal publication 1999.Google Scholar
  6. 6.
    J. Boyar, K. S. Larsen, and M. N. Nielsen. The Accommodating Function — A Generalization of the Competitive Ratio. In Sixth International Workshop on Algorithms and Data Structures, volume 1663 of Lecture Notes in Computer Science, pages 74–79. Springer-Verlag, 1999.CrossRefGoogle Scholar
  7. 7.
    E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Approximation Algorithms for Bin Packing: A Survey. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, chapter 2, pages 46–93. PWS Publishing Company, 1997.Google Scholar
  8. 8.
    E. G. Coffman, Jr., J. Y-T. Leung, and D. W. Ting. Bin Packing: Maximizing the Number of Pieces Packed. Acta Informatica, 9:263–271, 1978.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    E. G. Coffman, Jr. and Joseph Y-T. Leung. Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation. SIAM J. Comput., 8:202–217, 1979.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    J. Csirik and G. Woeginger. On-Line Packing and Covering Problems. In Gerhard J. Woeginger Amos Fiat, editor, Online Algorithms, volume 1442 of Lecture Notes in Computer Science, chapter 7, pages 147–177. Springer-Verlag, 1998.CrossRefGoogle Scholar
  11. 11.
    A. Fiat. Personal communication, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Yossi Azar
    • 1
  • Joan Boyar
    • 2
  • Lene M. Favrholdt
    • 2
  • Kim S. Larsen
    • 2
  • Morten N. Nielsen
    • 2
  1. 1.Department of Computer ScienceTel-Aviv UniversityUSA
  2. 2.Department of Mathematics and Computer ScienceUniversity of SouthernOdenseDenmark

Personalised recommendations