Abstract
Refined Harmonic (RH) is one of the best on-line bin packing algorithms. The algorithm was first proposed by Lee&Lee in 1985 and the upper bound of the worst-case performance ratio has been proved to be 1.63596..., In this paper, it is proved that 1.63596... is also the lower bound. The average performance of RH is also studied for the first time. It is shown that the average-case performance ratio of RH is 1.28243... under the uniform distribution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
