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$ ). 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.