Abstract
On-line algorithms have been extensively studied for the one-dimensional bin packing problem. In this paper we investigate two classes of the one- dimensional bin packing algorithms, and we give lower bounds for their asymptotic worst-case behaviour. For on-line algorithms so far the best lower bound was given by van Vliet in 1992 [13]. He proved that there is no on-line bin packing algorithm with better asymptotic performance ratio than 1.54014.... In this paper we give an improvement on this bound to 248/161 = 1.54037... and we investigate the parametric case as well. For those lists where the elements are preprocessed according to their sizes in decreasing order Csirik et al. [1] proved that no on-line algorithm can have an asymptotic performance ratio smaller than 8/7. We improve this result to 54/47.
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.
