Scheduling of Flexible Non-Preemptive Loads

被引:0
|
作者
Dahlin, Nathan [1 ]
Jain, Rahul [1 ]
机构
[1] Univ Southern Calif, ECE Dept, Los Angeles, CA 90089 USA
来源
2020 59TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC) | 2020年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A market consisting of a generator with thermal and renewable generation capability, a set of non-preemptive loads (i.e., loads which cannot be interrupted once started), and an independent system operator (ISO) is considered. Loads are characterized by durations, power demand rates and utility for receiving service, as well as disutility functions giving preferences for time slots in which service is preferred. Given this information, along with the generator's thermal generation cost function and forecast renewable generation, the social planner solves a mixed integer program to determine a load activation schedule which maximizes social welfare. Assuming price taking behavior, we develop a competitive equilibrium concept based on a relaxed version of the social planner's problem which includes prices for consumption and incentives for flexibility, and allows for probabilistic allocation of power to loads. Considering each load as representative of a population of identical loads with scaled characteristics, we demonstrate that the relaxed social planner's problem gives an exact solution to the original mixed integer problem in the large population limit.
引用
收藏
页码:2567 / 2572
页数:6
相关论文
共 50 条
  • [41] An efficient scheduling algorithm for the non-preemptive independent multiprocessor platform
    Andrei, Stefan
    Cheng, Albert M. K.
    Grigoras, Gheorghe
    Radulescu, Vlad
    INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING, 2012, 3 (04) : 215 - 223
  • [42] Preemption Delay Analysis for Floating Non-Preemptive Region Scheduling
    Marinho, Jose Manuel
    Nelis, Vincent
    Petters, Stefan M.
    Puaut, Isabelle
    DESIGN, AUTOMATION & TEST IN EUROPE (DATE 2012), 2012, : 497 - 502
  • [43] MYOPIC POLICIES FOR NON-PREEMPTIVE SCHEDULING OF JOBS WITH DECAYING VALUE
    Master, Neal
    Chan, Carri W.
    Bambos, Nicholas
    PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2018, 32 (01) : 1 - 36
  • [44] Quantifying the Exact Sub-Optimality of Non-Preemptive Scheduling
    Davis, Robert I.
    Thekkilakattil, Abhilash
    Gettings, Oliver
    Dobrin, Radu
    Punnekkat, Sasikumar
    2015 IEEE 36TH REAL-TIME SYSTEMS SYMPOSIUM (RTSS 2015), 2015, : 96 - 106
  • [45] Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm
    Ştefan Andrei
    Albert M. K. Cheng
    Vlad Rădulescu
    Mathematics in Computer Science, 2019, 13 : 489 - 515
  • [46] Performance evaluation of non-preemptive policies for scheduling readers and writers
    Kang, Sung-Il
    Pyun, Kihyun
    Lee, Heung-Kyu
    Operating Systems Review (ACM), 1999, 33 (03): : 43 - 57
  • [47] Non-preemptive coordination mechanisms for identical machine scheduling games
    Kollias, Konstantinos
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, 2008, 5058 : 197 - 208
  • [48] Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines
    G. Dósa
    Y. He
    Computing, 2006, 76 : 149 - 164
  • [49] Idle block based methods for cloud workflow scheduling with preemptive and non-preemptive tasks
    Chen, Long
    Li, Xiaoping
    Ruiz, Ruben
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2018, 89 : 659 - 669
  • [50] Non-preemptive real-time scheduling of multimedia tasks
    Dolev, S
    Keizelman, A
    REAL-TIME SYSTEMS, 1999, 17 (01) : 23 - 39