Peak Demand Minimization via Sliced Strip Packing

Deppert, MA and Jansen, K and Khan, A and Rau, M and Tutas, M (2023) Peak Demand Minimization via Sliced Strip Packing. In: Algorithmica, 85 (12). pp. 3649-3679.

PDF alg_85_12_2023 - Published Version Download (925kB)

Abstract

We study the Non-preemptive Peak Demand Minimization (NPDM) problem, where we are given a set of jobs, specified by their processing times and energy requirements. The goal is to schedule all jobs within a fixed time period such that the peak load (the maximum total energy requirement at any time) is minimized. This problem has recently received significant attention due to its relevance in smart-grids. Theoretically, the problem is related to the classical strip packing problem (SP). In SP, a given set of axis-aligned rectangles must be packed into a fixed-width strip, such that the height of the strip is minimized. NPDM can be modeled as strip packing with slicing and stacking constraint: each rectangle may be cut vertically into multiple slices and the slices may be packed into the strip as individual pieces. The stacking constraint forbids solutions where two slices of the same rectangle are intersected by the same vertical line. Non-preemption enforces the slices to be placed in contiguous horizontal locations (but may be placed at different vertical locations). We obtain a (5 / 3 + ε) -approximation algorithm for the problem. We also provide an asymptotic efficient polynomial-time approximation scheme (AEPTAS) which generates a schedule for almost all jobs with energy consumption (1 + ε) OPT . The remaining jobs fit into a thin container of height 1. This AEPTAS is used as a subroutine to acquire the (5 / 3 + ε) -approximation algorithm. The previous best result for NPDM was a 2.7-approximation based on FFDH (Ranjan et al., in: 2015 IEEE symposium on computers and communication (ISCC), pp 758�763, IEEE, 2015). One of our key ideas is providing several new lower bounds on the optimal solution of a geometric packing, which could be useful in other related problems. These lower bounds help us to obtain approximative solutions based on Steinberg�s algorithm in many cases. In addition, we show how to split schedules generated by the AEPTAS into few segments and to rearrange the corresponding jobs to insert the thin container mentioned above, such that it does not exceed the bound of (5 / 3 + ε) OPT . © 2023, The Author(s).

Item Type:	Journal Article
Publication:	Algorithmica
Publisher:	Springer
Additional Information:	The copyright for this article belongs to authors.
Keywords:	Containers; Energy utilization; Geometry; Job shop scheduling; Polynomial approximation, Approximation; Asymptotics; Minimisation; Non-preemptive; Peak demand; Peak demand minimization; Polynomial time approximation schemes; Scheduling; Strip packing; Strip packing problem, Approximation algorithms
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	18 Nov 2024 21:48
Last Modified:	18 Nov 2024 21:48
URI:	http://eprints.iisc.ac.in/id/eprint/85346

Actions (login required)

View Item