2012
DOI: 10.1109/tsg.2011.2177103
|View full text |Cite
|
Sign up to set email alerts
|

A Water-Filling Based Scheduling Algorithm for the Smart Grid

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
62
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 90 publications
(62 citation statements)
references
References 11 publications
0
62
0
Order By: Relevance
“…In the smart grid context, Shinwari et al (2012) propose transmitting operation probabilities for shiftable loads to local control agents. The probabilities for starting shiftable loads are high in hours with low non-shiftable load in the system.…”
Section: Randomized Load Controlmentioning
confidence: 99%
“…In the smart grid context, Shinwari et al (2012) propose transmitting operation probabilities for shiftable loads to local control agents. The probabilities for starting shiftable loads are high in hours with low non-shiftable load in the system.…”
Section: Randomized Load Controlmentioning
confidence: 99%
“…However, most of them do not consider fairness among customers. To the best of our knowledge, the only work that discussed fairness is [8], [9], [10] and [11].…”
Section: Related Workmentioning
confidence: 99%
“…In [21] the authors use convex optimization tools and solve a cooperative scheduling problem in a smart grid. The authors in [22] used a water-filling based scheduling algorithm to obtain a flat demand curve. The proposed algorithm does not require any communication between scheduling nodes.…”
Section: State Of the Artmentioning
confidence: 99%