Scheduling Non-Preemptible Jobs to Minimize Peak Demand
AbstractThis paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the peak demand minimization problem, and has been previously shown to be NP-hard. Our results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show that these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Yaw, S.; Mumey, B. Scheduling Non-Preemptible Jobs to Minimize Peak Demand. Algorithms 2017, 10, 122.
Yaw S, Mumey B. Scheduling Non-Preemptible Jobs to Minimize Peak Demand. Algorithms. 2017; 10(4):122.Chicago/Turabian Style
Yaw, Sean; Mumey, Brendan. 2017. "Scheduling Non-Preemptible Jobs to Minimize Peak Demand." Algorithms 10, no. 4: 122.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.