Asymptotically optimal scheduling of random malleable demands in smart grid
From MaRDI portal
Publication:4634529
DOI10.1142/S1793830918500258zbMath1390.90334OpenAlexW2786984082MaRDI QIDQ4634529
Mohammad M. Karbasioun, Gennady Shaikhet, Ioannis Lambadaris, Evangelos Kranakis
Publication date: 10 April 2018
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830918500258
Related Items (4)
A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing ⋮ Peak demand minimization via sliced strip packing ⋮ Non-preemptive scheduling in a smart grid model and its implications on machine minimization ⋮ Asymptotically optimal scheduling of random malleable demands in smart grid
Cites Work
- Unnamed Item
- Unnamed Item
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Offline first-fit decreasing height scheduling of power loads
- Two-dimensional packing problems: a survey
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- Smart-Grid Electricity Allocation via Strip Packing with Slicing
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- Asymptotically optimal scheduling of random malleable demands in smart grid
- Next-fit bin packing with random piece sizes
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Online strip packing with modifiable boxes
This page was built for publication: Asymptotically optimal scheduling of random malleable demands in smart grid