Online Bin Packing with Known T

12/06/2021
by   Shang Liu, et al.
0

In the online bin packing problem, a sequence of items is revealed one at a time, and each item must be packed into an available bin instantly upon its arrival. In this paper, we revisit the problem under a setting where the total number of items T is known in advance, also known as the closed online bin packing problem. Specifically, we study both the stochastic model and the random permutation model. We develop and analyze an adaptive algorithm that solves an offline bin packing problem at geometric time intervals and uses the offline optimal solution to guide online packing decisions. Under both models, we show that the algorithm achieves C√(T) regret (in terms of the number of used bins) compared to the hindsight optimal solution, where C is a universal constant (<= 13) that bears no dependence on the underlying distribution or the item sizes. The result shows the lower bound barrier of Ω(√(T logT)) in Shor (1986) can be broken with solely the knowledge of the horizon T, but without a need of knowing the underlying distribution. As to the algorithm analysis, we develop a new approach to analyzing the packing dynamic using the notion of exchangeable random variables. The approach creates a symmetrization between the offline solution and the online solution, and it is used to analyze both the algorithm performance and various benchmarks related to the bin packing problem. For the latter one, our analysis provides an alternative (probably simpler) treatment and tightens the analysis of the asymptotic benchmark of the stochastic bin packing problem in Rhee and Talagrand (1989a,b). As the analysis only relies on a symmetry between the offline and online problems, the algorithm and benchmark analyses can be naturally extended from the stochastic model to the random permutation model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2022

Near-optimal Algorithms for Stochastic Online Bin Packing

We study the online bin packing problem under two stochastic settings. I...
research
05/02/2019

Online Circle Packing

We consider the online problem of packing circles into a square containe...
research
10/14/2020

More on ordered open end bin packing

We consider the Ordered Open End Bin Packing problem. Items of sizes in ...
research
12/24/2021

Robust Secretary and Prophet Algorithms for Packing Integer Programs

We study the problem of solving Packing Integer Programs (PIPs) in the o...
research
10/08/2019

Parallel Online Algorithms for the Bin Packing Problem

We study parallel online algorithms: For some fixed integer k, a colle...
research
07/22/2020

Online Adaptive Bin Packing with Overflow

Motivated by bursty bandwidth allocation and by the allocation of virtua...
research
08/19/2019

On bin packing with clustering and bin packing with delays

We continue the study of two recently introduced bin packing type proble...

Please sign up or login with your details

Forgot password? Click here to reset