We revisit the classic online bin packing problem. In this problem, items of positive sizes no
larger than 1 are presented one by one to be packed into subsets called" bins" of total sizes …

Consider the classical online scheduling problem, in which jobs that arrive one by one are
assigned to identical parallel machines with the objective of minimizing the makespan. We …

We consider the fully dynamic bin packing problem, where items arrive and depart in an
online fashion and repacking of previously packed items is allowed. The goal is, of course …

We study the classic bin packing problem in a fully-dynamic setting, where new items can
arrive and old items may depart. We want algorithms with low asymptotic competitive ratio …

Scheduling a set of n jobs on m identical parallel machines so as to minimize the makespan
or maximize the minimum machine load are two of the most important and fundamental …

Preemptive scheduling problems on parallel machines are classic problems. Given the goal
of minimizing the makespan, they are polynomially solvable even for the most general …

The harmonic algorithm, defined for online bin packing, partitions items into a fixed number
M of classes of similar items, and packs each class independently and greedily in constant …

Square bin packing, where square items are to be packed into a minimum number of unit
size squares, and its multidimensional generalization, cube packing, where d-dimensional …

Online models that allow recourse can be highly effective in situations where classical
online models are too pessimistic. One such problem is the online machine covering …

In the Dynamic Bin Packing problem, n items arrive and depart the system in an online
manner, and the goal is to maintain a good packing throughout. We consider the objective of …