Peak demand minimization via sliced strip packing
From MaRDI portal
Publication:6066765
DOI10.1007/s00453-023-01152-wOpenAlexW3163152928MaRDI QIDQ6066765
Max A. Deppert, Arindam Khan, Malin Rau, Malte Tutas, Klaus Jansen
Publication date: 13 December 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-023-01152-w
Cites Work
- Rectangle packing with one-dimensional resource augmentation
- Maximizing the total profit of rectangles packed into a rectangle
- On contiguous and non-contiguous parallel task scheduling
- A 2.5 times optimal algorithm for packing in two dimensions
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
- Approximation and online algorithms for multidimensional bin packing: a survey
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- Smart-Grid Electricity Allocation via Strip Packing with Slicing
- APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS
- A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing
- Approximating the Non-contiguous Multiple Organization Packing Problem
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- On approximating strip packing with a better ratio than 3/2
- Asymptotically optimal scheduling of random malleable demands in smart grid
- Optimal Nonpreemptive Scheduling in a Smart Grid Model
- Improved Pseudo-Polynomial-Time Approximation for Strip Packing
- Hardness of Approximation for Strip Packing
- Approximating Geometric Knapsack via L-packings
- Closing the Gap for Pseudo-Polynomial Strip Packing
- Approximation Schemes for Independent Set and Sparse Subsets of Polygons
- A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes
- Improved Approximation Algorithm for Two-Dimensional Bin Packing
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Approximation Algorithms for Scheduling Parallel Jobs
- Complexity and inapproximability results for parallel task scheduling and strip packing
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- On Guillotine Separability of Squares and Rectangles.
- Approximation Algorithms for Demand Strip Packing
This page was built for publication: Peak demand minimization via sliced strip packing
