Peak Demand Minimization via Sliced Strip Packing.

DOI10.4230/lipics.approx/random.2021.21arXiv2105.07219OpenAlexW3202391892MaRDI QIDQ6090895

Malte Tutas, Malin Rau, Arindam Khan, Klaus Jansen, Max A. Deppert

Publication date: 20 November 2023

Full work available at URL: https://arxiv.org/abs/2105.07219

zbMATH Keywords

schedulingapproximationpeak demand minimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Lower bounds on the performance of online algorithms for relaxed packing problems ⋮ Tight approximation algorithms for geometric bin packing with skewed items

This page was built for publication: Peak Demand Minimization via Sliced Strip Packing.