EconPapers    
Economics at your fingertips  
 

On-line bin packing with restricted repacking

János Balogh (), József Békési (), Gábor Galambos () and Gerhard Reinelt ()
Additional contact information
János Balogh: University of Szeged
József Békési: University of Szeged
Gábor Galambos: University of Szeged
Gerhard Reinelt: University of Heidelberg

Journal of Combinatorial Optimization, 2014, vol. 27, issue 1, No 10, 115-131

Abstract: Abstract Semi-on-line algorithms for the bin-packing problem allow, in contrast to pure on-line algorithms, the use of certain types of additional operations for each step. Examples include repacking, reordering or lookahead before packing the items. Here we define and analyze a semi-on-line algorithm where for each step at most k items can be repacked, for some positive integer k. We prove that the upper bound for the asymptotic competitive ratio of the algorithm is a decreasing function of k, which tends to 3/2 as k goes to infinity. We also establish lower bounds for this ratio and show that the gap between upper and lower bounds is relatively small.

Keywords: Bin-packing; Semi-on-line algorithm; Worst-case behavior; Competitive analysis (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9489-4 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:27:y:2014:i:1:d:10.1007_s10878-012-9489-4

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

DOI: 10.1007/s10878-012-9489-4

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 ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:27:y:2014:i:1:d:10.1007_s10878-012-9489-4