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

Xiaodong Gu, Guoliang Chen (), Jun Gu (), Liusheng Huang and Yunjae Jung ()
Additional contact information
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

Journal of Combinatorial Optimization, 2002, vol. 6, issue 4, No 5, 455-471

Abstract: 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.

Keywords: bin packing problem; approximation algorithms; worst-case performance ratio; average-case performance ratio; NPC problem (search for similar items in EconPapers)
Date: 2002
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1019577921700 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:6:y:2002:i:4:d:10.1023_a:1019577921700

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1019577921700

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().