ABSTRACT
This chapter discusses the variant in which the number of items packed is maximized. It describes a variant that places a bound on the number of items that can be packed in each bin and presents a dynamic bin packing model, in which packings change with time; each item has an arrival and departure time that define the time interval during which an item occupies a bin. The chapter considers the black-and-white bin packing problem defined by J. Balogh et al. where the colors of the items place restrictions on the order in which they can be packed. It provides the results on maximal resource bin packing defined by J. Boyar et al., where the objective is to use a maximal number of bins. The chapter deals with a model defined by N. Bansal et al., which includes the notion of items having not only sizes but fragility values.
