Scheduling of Flexible Non-Preemptive Loads

被引:0
|
作者
Dahlin, Nathan [1 ]
Jain, Rahul [1 ]
机构
[1] Univ Southern Calif, ECE Dept, Los Angeles, CA 90089 USA
关键词
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 条
  • [31] The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors
    Sanjoy K. Baruah
    Real-Time Systems, 2006, 32 : 9 - 20
  • [32] Provably efficient non-preemptive task scheduling with Cilk
    Vee, VB
    Hsu, WJ
    TWENTY-SECOND ANNUAL INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE - PROCEEDINGS, 1998, : 602 - 607
  • [33] Online Non-Preemptive Story Scheduling in Web Advertising
    Liu, Tie-Yan
    Ma, Weidong
    Qin, Tao
    Tang, Pingzhong
    Yang, Guang
    Zheng, Bo
    AAMAS'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2016, : 269 - 277
  • [34] Design and Timing Guarantee for Non-Preemptive Gang Scheduling
    Lee, Seongtae
    Guan, Nan
    Lee, Jinkyu
    2022 IEEE 43RD REAL-TIME SYSTEMS SYMPOSIUM (RTSS 2022), 2022, : 132 - 144
  • [35] Fault tolerant global scheduling with non-preemptive backups
    Peng H.
    Lu Y.
    Sun F.
    Han J.-H.
    Han, Jiang-Hong (hanjh@hfut.edu.cn), 1600, Chinese Academy of Sciences (27): : 3158 - 3171
  • [36] On the Complexity of Non-preemptive Shop Scheduling with Two Jobs
    Tamás Kis
    Computing, 2002, 69 : 37 - 49
  • [37] An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling
    Yaw, Sean
    Mumey, Brendan
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014), 2014, 8881 : 3 - 12
  • [38] Resource Bounding for Non-preemptive Task Scheduling on a Multiprocessor Platform
    Radulescu, Vlad
    Andrei, Stefan
    Cheng, Albert M. K.
    PROCEEDINGS OF 2016 18TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC), 2016, : 149 - 156
  • [39] Non-Preemptive Open Shop Scheduling Considering Machine Availability
    Barjouei, A. Shojaei
    Barabadi, Abbas
    Tavakkoli-Moghaddam, R.
    2019 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2019, : 1280 - 1284
  • [40] Non-preemptive min-sum scheduling with resource augmentation
    Bansal, Nikhil
    Chan, Ho-Leung
    Khandekar, Rohit
    Pruhs, Kirk
    Schieber, Baruch
    Stein, Cliff
    48TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2007, : 614 - +