On-line extensible bin packing with unequal bin sizes
Citations Over Time
Abstract
Analysis of Algorithms In the extensible bin packing problem we are asked to pack a set of items into a given number of bins, each with an original size. However, the original bin sizes can be extended if necessary. The goal is to minimize the total size of the bins. We consider the problem with unequal (original) bin sizes and give the complete analysis on a list scheduling algorithm (LS). Namely we present tight bounds of LS for every collection of original bin sizes and every number of bins. We further show better on-line algorithms for the two-bin case and the three-bin case. Interestingly, it is proved that the on-line algorithms have better competitive ratios for unequal bins than for equal bins. Some variants of the problem are also discussed.
Related Papers
- → Online Results for Black and White Bin Packing(2014)20 cited
- → A New Approach to Online Scheduling(2016)10 cited
- → Tight Bounds for Online TSP on the Line(2017)5 cited
- A New Approach to Competitive Analysis: Approximating the Optimal Competitive Ratio(2012)