Online scheduling for electricity cost in smart grid

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

This paper studies an online scheduling problem in the smart grid, which is arised in demand response management under the scenario with real-time communication between the grid operator and consumers. Consumers send the power requests online over-list. The request is released with a limited set of timeslots. Only one of the timeslots in the set can this request be served by the operator. In a timeslot, the electricity cost consumed to serve the requests is a quadratic function of the load in it. Our aim is to find a best possible online schedule which generates the minimal total electricity cost. In this paper, we propose a greedy algorithm of this problem which is 2-competitive. Besides, we prove our algorithm is optimal.

Original languageEnglish
Title of host publicationCombinatorial Optimization and Applications - 9th International Conference, COCOA 2015, Proceedings
EditorsDonghyun Kim, Weili Wu, Ding-Zhu Du, Zaixin Lu, Wei Li
PublisherSpringer Verlag
Pages783-793
Number of pages11
ISBN (Print)9783319266251
DOIs
StatePublished - 2015
Event9th International Conference on Combinatorial Optimization and Applications, COCOA 2015 - Houston, United States
Duration: 18 Dec 201520 Dec 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9486
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Conference on Combinatorial Optimization and Applications, COCOA 2015
Country/TerritoryUnited States
CityHouston
Period18/12/1520/12/15

Keywords

  • Demand response
  • Greedy algorithm
  • Online scheduling
  • Smart grid

Fingerprint

Dive into the research topics of 'Online scheduling for electricity cost in smart grid'. Together they form a unique fingerprint.

Cite this