The Temporal Bin Packing Problem: An Application to Workload Management in Data Centres

An introduction to stochastic bin packing-based server consolidation with conflicts

“…By way of example, we refer the reader to some (by far not exhaustive) surveys (Delorme et al 2016;Valério de Carvalho 2002) and standard references about approximation algorithms (Coffman et al 2013(Coffman et al , 1984, branch-and-bound based techniques (Belov and Scheithauer 2006;Valério de Carvalho 1999;Vance 1998;Vance et al 1994), classical pseudo-polynomial integer linear programming (ILP) formulations (Dyckhoff 1981;Martinovic et al 2018;Valério de Carvalho 2002), or modern and advanced approaches (Brandão and Pedroso 2016;Clautiaux et al 2017;Delorme and Iori 2020;Wei et al 2020). Moreover, in the last couple of years, (deterministic) generalizations with respect to a temporal dimension have been proposed in various articles (Aydin et al 2020;de Cauwer et al 2016;Dell'Amico et al 2020).…”

“…By this common interval, all feasibility conditions for the consolidation will be contained in the optimization problem-even if single jobs start a little earlier or stop a bit later. A more detailed investigation with distinct job-specific start and end times would result in a stochastic version of the Temporal Bin Packing Problem (TBPP), see(Aydin et al 2020;de Cauwer et al 2016;Dell'Amico et al 2020;Martinovic et al 2021). For this purpose, however, the basics of the ordinary stochastic BPP must first be derived, and this is precisely the aim of the present article.…”

Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups

“…Each job is characterized by a size (or resource demand) and a lifespan (time window in which the job is active), a jobs-to-servers assignment is feasible if and only if the capacity of the servers is respected at any instant of time. The TBPP is a challenging problem with a high practical and theoretical interest which has been recently introduced in the literature, see [9,10]. It belongs to the rich family of cutting and packing problems, object of intense research in the last decades.…”

Multi-objective temporal bin packing problem: An application in cloud computing

“…In this paper, we consider the temporal extension of the bin packing problem, known as the temporal bin packing (TBP) problem (Cauwer et al (2016); Furini and Shen (2018); Dell'Amico et al ( 2019)), where the tasks are to be performed in fixed start and end times during a planning period. The TBP problem is an extension of the temporal knapsack problem for which Caprara et al (2013Caprara et al ( , 2016 proposed exact approaches based on recursive Dantzig-Wolfe decomposition (Dantzig and Wolfe (1960)).…”

“…While each arriving VM request is assigned to a server in the first phase, the system is periodically reviewed and reoptimized in the second phase. Cauwer et al (2016) generalize the bin packing problem by minimizing the unused resources over time. Although the authors consider the time dimension, they assume that all VM requests arrive at the same time but can depart at different times.…”