Scheduling, pricing, and efficiency of non-preemptive flexible loads under direct load control

Abhishek K. Gupta, R. Jain, R. Rajagopal
{"title":"Scheduling, pricing, and efficiency of non-preemptive flexible loads under direct load control","authors":"Abhishek K. Gupta, R. Jain, R. Rajagopal","doi":"10.1109/ALLERTON.2015.7447118","DOIUrl":null,"url":null,"abstract":"A market comprising a scheduler with a renewable generator and a pumped water storage system, a certain number of flexible and inflexible loads, and a non-renewable generator is considered. At the beginning of activity, the scheduler receives the following three information from each of the loads - consumption (in MW), duration (in hours) and start window. The start window of a load is the time interval in which the load must be started. A load is inflexible if its start window is singleton. The loads are assumed to be non-preemptive, that is, after a load is started, it cannot be interrupted or paused, and it must be served for its duration. The goal of the scheduler is to develop a scheduling policy that minimizes the aggregate cost of buying electricity from the non-renewable generator. We develop an understanding of the nature of optimal solutions to such an optimization problem and propose an approximately optimal scheduling policy for a sufficiently wide class of scheduling problems.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2015.7447118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

A market comprising a scheduler with a renewable generator and a pumped water storage system, a certain number of flexible and inflexible loads, and a non-renewable generator is considered. At the beginning of activity, the scheduler receives the following three information from each of the loads - consumption (in MW), duration (in hours) and start window. The start window of a load is the time interval in which the load must be started. A load is inflexible if its start window is singleton. The loads are assumed to be non-preemptive, that is, after a load is started, it cannot be interrupted or paused, and it must be served for its duration. The goal of the scheduler is to develop a scheduling policy that minimizes the aggregate cost of buying electricity from the non-renewable generator. We develop an understanding of the nature of optimal solutions to such an optimization problem and propose an approximately optimal scheduling policy for a sufficiently wide class of scheduling problems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
直接负荷控制下非抢占柔性负荷的调度、定价和效率
考虑一个包含可再生能源发电机组和抽水蓄能系统的调度器、一定数量的灵活负荷和不灵活负荷以及不可再生能源发电机组的市场。在活动开始时,调度器从每个负载接收以下三个信息——消耗(以MW为单位)、持续时间(以小时为单位)和启动窗口。负载的开始窗口是必须启动负载的时间间隔。如果一个加载的开始窗口是单例的,那么它就是不灵活的。假设负载是非抢占式的,也就是说,负载启动后,它不能被中断或暂停,并且必须在其持续时间内为其提供服务。调度程序的目标是制定一个调度策略,使从不可再生发电机购买电力的总成本最小化。我们对这类优化问题的最优解的本质进行了理解,并对一类足够广泛的调度问题提出了近似最优调度策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Robust temporal logic model predictive control Efficient replication of queued tasks for latency reduction in cloud systems Cut-set bound is loose for Gaussian relay networks Improving MIMO detection performance in presence of phase noise using norm difference criterion Utility fair RAT selection in multi-homed LTE/802.11 networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1