Abstract: Highlights •We tackle the challenge of semi-online workload consolidation.•We propose a formal framework capturing the semi-online consolidation problem.•We propose a dynamic allocation algorithm based on incremental merging of bins.•We adapt bin packing heuristics enhanced by local search to the semi-online context.•Our approach “First Merged Fit” saves up to 40% more resources than other policies.
Loading