Scheduling for electricity cost in a smart grid
From MaRDI portal
Publication:1702731
DOI10.1007/s10951-015-0447-8zbMath1386.90047OpenAlexW644289291MaRDI QIDQ1702731
David K. Y. Yau, Wing-Kai Hon, Hsiang-Hsuan Liu, Mihai Burcea, Prudence W. H. Wong
Publication date: 28 February 2018
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-015-0447-8
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
Competitive algorithms for demand response management in a smart grid ⋮ Non-preemptive scheduling in a smart grid model and its implications on machine minimization ⋮ Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling on a single machine under time-of-use electricity tariffs
- A polynomial algorithm for minimum quadratic cost flow problems
- Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Scheduling for Electricity Cost in Smart Grid
- Solving integer minimum cost flows with separable convex cost objective polynomially
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
- New polynomial-time cycle-canceling algorithms for minimum-cost flows
- Fibonacci heaps and their uses in improved network optimization algorithms
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- Convex separable optimization is not much harder than linear optimization
This page was built for publication: Scheduling for electricity cost in a smart grid
