IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v6y2002i4d10.1023_a1019577921700.html
   My bibliography  Save this article

Performance Analysis and Improvement for Some Linear On-Line Bin-Packing Algorithms

Author

Listed:
  • Xiaodong Gu

    (University of Science and Technology of China)

  • Guoliang Chen

    (University of Science and Technology of China)

  • Jun Gu

    (University of Science and Technology of Hong Kong)

  • Liusheng Huang

    (University of Science and Technology of China)

  • Yunjae Jung

    (University of Minnesota)

Abstract

The study on one-dimensional bin packing problem may bring about many important applications such as multiprocessor scheduling, resource allocating, real-world planning and packing. Harmonic algorithms (including H K, RH, etc.) for bin packing have been famous for their linear-time and on-line properties for a long time. This paper profoundly analyzes the average-case performance of harmonic algorithms for pieces of i.i.d. sizes, provides the average-case performance ratio of H K under (0,d] (d ≤ 1) uniform distribution and the average-case performance ratio of RH under (0,1] uniform distribution. We also finished the discussion of the worst-case performance ratio of RH. Moreover, we propose a new improved version of RH that obtains better worst- and average-case performance ratios.

Suggested Citation

  • Xiaodong Gu & Guoliang Chen & Jun Gu & Liusheng Huang & Yunjae Jung, 2002. "Performance Analysis and Improvement for Some Linear On-Line Bin-Packing Algorithms," Journal of Combinatorial Optimization, Springer, vol. 6(4), pages 455-471, December.
    • Handle: RePEc:spr:jcomop:v:6:y:2002:i:4:d:10.1023_a:1019577921700
    DOI: 10.1023/A:1019577921700
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1019577921700
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1019577921700?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:6:y:2002:i:4:d:10.1023_a:1019577921700. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.