Approximation Algorithms for Demand Strip Packing

05/18/2021
by   Waldo Gálvez, et al.
0

In the Demand Strip Packing problem (DSP), we are given a time interval and a collection of tasks, each characterized by a processing time and a demand for a given resource (such as electricity, computational power, etc.). A feasible solution consists of a schedule of the tasks within the mentioned time interval. Our goal is to minimize the peak resource consumption, i.e. the maximum total demand of tasks executed at any point in time. It is known that DSP is NP-hard to approximate below a factor 3/2, and standard techniques for related problems imply a (polynomial-time) 2-approximation. Our main result is a (5/3+eps)-approximation algorithm for any constant eps>0. We also achieve best-possible approximation factors for some relevant special cases.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/23/2018

Improved Pseudo-Polynomial-Time Approximation for Strip Packing

We study the strip packing problem, a classical packing problem which ge...
01/08/2021

Almost Optimal Inapproximability of Multidimensional Packing Problems

Multidimensional packing problems generalize the classical packing probl...
05/15/2021

Peak Demand Minimization via Sliced Strip Packing

We study Nonpreemptive Peak Demand Minimization (NPDM) problem, where we...
06/24/2020

Approximation algorithms for the MAXSPACE advertisement problem

In the MAXSPACE problem, given a set of ads A, one wants to schedule a s...
09/12/2018

Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems

In real-time systems, in addition to the functional correctness recurren...
02/25/2020

Stochastic Makespan Minimization in Structured Set Systems

We study stochastic combinatorial optimization problems where the object...
03/04/2015

Estimating the Probability of Meeting a Deadline in Hierarchical Plans

Given a hierarchical plan (or schedule) with uncertain task times, we pr...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.