# iGreen: green scheduling for peak demand minimization

iGreen: green scheduling for peak demand minimization Home owners are typically charged differently when they consume power at different periods within a day. Specifically, they are charged more during peak periods. Thus, in this paper, we explore how scheduling algorithms can be designed to minimize the peak energy consumption of a group of homes served by the same substation. We assume that a set of demand/response switches are deployed at a group of homes to control the activities of different appliances such as air conditioners or electric water heaters in these homes. Given a set of appliances, each appliance is associated with its instantaneous power consumption and duration, our objective is to decide when to activate different appliances in order to reduce the peak power consumption. This scheduling problem is shown to be NP-Hard. To tackle this problem, we propose a set of appliance scheduling algorithms under both offline and online settings. For the offline setting, we propose a constant ratio approximation algorithm (with approximation ratio $$\frac{1+\sqrt{5}}{2}+1$$ 1 + 5 2 + 1 ). For the online setting, we adopt a greedy algorithm whose competitive ratio is also bounded. We conduct extensive simulations using real-life appliance energy consumption data trace to evaluate the performance of our algorithms. Extensive evaluations show that our schedulers significantly reduce the peak demand when compared with several existing heuristics. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Global Optimization Springer Journals

# iGreen: green scheduling for peak demand minimization

, Volume 69 (1) – Apr 18, 2017
23 pages

/lp/springer_journal/igreen-green-scheduling-for-peak-demand-minimization-AO588v1pFc
Publisher
Springer US
Subject
Mathematics; Optimization; Operations Research/Decision Theory; Real Functions; Computer Science, general
ISSN
0925-5001
eISSN
1573-2916
D.O.I.
10.1007/s10898-017-0524-y
Publisher site
See Article on Publisher Site

### Abstract

Home owners are typically charged differently when they consume power at different periods within a day. Specifically, they are charged more during peak periods. Thus, in this paper, we explore how scheduling algorithms can be designed to minimize the peak energy consumption of a group of homes served by the same substation. We assume that a set of demand/response switches are deployed at a group of homes to control the activities of different appliances such as air conditioners or electric water heaters in these homes. Given a set of appliances, each appliance is associated with its instantaneous power consumption and duration, our objective is to decide when to activate different appliances in order to reduce the peak power consumption. This scheduling problem is shown to be NP-Hard. To tackle this problem, we propose a set of appliance scheduling algorithms under both offline and online settings. For the offline setting, we propose a constant ratio approximation algorithm (with approximation ratio $$\frac{1+\sqrt{5}}{2}+1$$ 1 + 5 2 + 1 ). For the online setting, we adopt a greedy algorithm whose competitive ratio is also bounded. We conduct extensive simulations using real-life appliance energy consumption data trace to evaluate the performance of our algorithms. Extensive evaluations show that our schedulers significantly reduce the peak demand when compared with several existing heuristics.

### Journal

Journal of Global OptimizationSpringer Journals

Published: Apr 18, 2017

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations