Abstract: In this paper, we consider the temporal bin packing problem that originated from cloud computing (Ratushnyi, Kochetov, 2021). Suppose we are given a finite set of items and for each item, an arriving time, a processing time, and two weights (dimensions) are known. A certain subset of all items is called a set of large items. Each bin has two capacities (dimensions) and is divided into two identical parts. A large item should be divided into two identical parts and placed in both parts of a bin. Other items can be placed in one part of a bin, if there is enough capacity there in both dimensions. The goal is to pack all items into the minimum number of bins of identical dimensions. We propose a genetic algorithm for this problem and describe the results of computational experiment.

Cite: Sakhno M. , Eremeev A.V.
A genetic algorithm for the temporal bin packing problem
International Conference Mathematical Optimization Theory and Operations Research Petrozavodsk, Karelia, Russia, July 2-6, 2022 02-08 Jul 2022