Competitive Algorithms for Demand Response Management in Smart Grid
文献类型：会议论文
| 作者 | Vincent Chau; Shengzhong Feng; Nguyen Kim Thang |
| 出版日期 | 2018 |
| 会议日期 | 2018 |
| 会议地点 | 布宜诺斯艾利斯，阿根廷 |
| 英文摘要 | We consider a scheduling problem which abstracts a model of demand-response management in Smart Grid. In the problem, there is a set of unrelated machines and each job $j$ (representing a client demand) is characterized by a release date, and a power request function representing its request demand at specific times. Each machine has an energy power function and the energy cost incurred at a time depends on the load of the machine at that time. The goal is to find a non-migration schedule that minimizes the total energy (over all times). We give a competitive algorithm for the problem in the online setting where the competitive ratio depends (only) on the power functions of machines. In the setting with typical energy function $P(z) = z^{\nu}$, the algorithm is $\Theta(\nu^{\nu})$-competitive, which is \emph{optimal} up to a constant factor. Our algorithm is \emph{robust} in the sense that the guarantee holds for arbitrary request demands of clients. This enables flexibility on the choices of clients in shaping their demands --- a desired property in Smart Grid. We also consider a special case in offline setting in which jobs have unit processing time, constant power request and identical machines with energy function $P(z) = z^{\nu}$. We present a $2^{\nu}$-approximation algorithm for this case. |
| 语种 | 英语 |
| URL标识 | 查看原文 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/14060]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 推荐引用方式 GB/T 7714 | Vincent Chau,Shengzhong Feng,Nguyen Kim Thang. Competitive Algorithms for Demand Response Management in Smart Grid[C]. 见:. 布宜诺斯艾利斯，阿根廷. 2018. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。