Scheduling for electricity cost in a smart grid

Mihai Burcea (), Wing-Kai Hon (), Hsiang-Hsuan Liu (), Prudence W. H. Wong () and David K. Y. Yau ()
Additional contact information
Mihai Burcea: University of Liverpool
Wing-Kai Hon: National Tsing Hua University
Hsiang-Hsuan Liu: University of Liverpool
Prudence W. H. Wong: University of Liverpool
David K. Y. Yau: Singapore University of Technology and Design

Journal of Scheduling, 2016, vol. 19, issue 6, No 6, 687-699

Abstract: Abstract We study an offline scheduling problem arising in demand response management in a smart grid. Consumers send in power requests with a flexible set of timeslots during which their requests can be served. For example, a consumer may request the dishwasher to operate for 1 h during the periods 8am to 11am or 2pm to 4pm. The grid controller, upon receiving power requests, schedules each request within the specified duration. The electricity cost is measured by a convex function of the load in each timeslot. The objective of the problem is to schedule all requests with the minimum total electricity cost. As a first attempt, we consider a special case in which the power requirement and the duration a for which a request needs service are both unit-size. For this problem, we present a polynomial time offline algorithm that gives an optimal solution and shows that the time complexity can be further improved if the given set of timeslots forms a contiguous interval.

Keywords: Optimization; Convex power cost; Optimal algorithms; Time complexity; Feasible graph (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (22)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-015-0447-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:19:y:2016:i:6:d:10.1007_s10951-015-0447-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-015-0447-8

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().