Assigning jobs onto identical machines with the objective to minimize the maximal load is
one of the most basic problems in combinatorial optimization and has many practical …

We study the following variant of the bin packing problem. We are given a set of items,
where each item has a (non-negative) size and a color. We are also given an integer …

We consider two related scheduling problems: single resource-constrained scheduling on
identical parallel machines and a generalization with resource-dependent processing times …

Bin packing with cardinality constraints is a basic bin packing problem. In the online version
with the parameter k≥ 2, items having sizes in (0, 1] associated with them are presented …

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 …

Following the work of Anily et al., we consider a variant of bin packing called bin packing
with general cost structures (GCBP) and design an asymptotic fully polynomial time …

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 …

We study a bin packing problem in which a bin can contain at most k items of total size at
most 1, where k≥ 2 is a given parameter. Items are presented one by one in an online …

The generalized bin packing problem (GBPP) is a novel packing problem arising in many
transportation and logistic settings, characterized by multiple items and bins attributes and …

We study the d-DIMENSIONAL VECTOR BIN PACKING (dVBP) problem, a generalization of
BIN PACKING with central applications in resource allocation and scheduling. In dVBP, we …