Risk-averse single machine scheduling: complexity and approximation

被引:11
|
作者
Kasperski, Adam [1 ]
Zielinski, Pawel [2 ]
机构
[1] Wroclaw Univ Sci & Technol, Fac Comp Sci & Management, Dept Operat Res, Wroclaw, Poland
[2] Wroclaw Univ Sci & Technol, Fac Fundamental Problems Technol, Dept Comp Sci, Wroclaw, Poland
关键词
Single machine; Value at risk; Conditional value at risk; Computational complexity; Approximation algorithms; Robust scheduling; VALUE-AT-RISK; MINMAX REGRET; OPTIMIZATION PROBLEMS; SEQUENCING PROBLEM; TIME; ALGORITHM; MAX;
D O I
10.1007/s10951-019-00599-6
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, a class of single machine scheduling problems is considered. It is assumed that job processing times and due dates can be uncertain and they are specified in the form of discrete scenario set. A probability distribution in the scenario set is known. In order to choose a schedule, some risk criteria such as the value at risk and conditional value at risk are used. Various positive and negative complexity results are provided for basic single machine scheduling problems. In this paper, new complexity results are shown and some known complexity results are strengthened.
引用
收藏
页码:567 / 580
页数:14
相关论文
共 50 条
  • [1] Risk-averse single machine scheduling: complexity and approximation
    Adam Kasperski
    Paweł Zieliński
    [J]. Journal of Scheduling, 2019, 22 : 567 - 580
  • [2] APPROXIMATION ALGORITHMS FOR STOCHASTIC AND RISK-AVERSE OPTIMIZATION
    Byrka, Jaroslaw
    Srinivasan, Aravind
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (01) : 44 - 63
  • [3] A Risk-averse Employee Scheduling with Uncertainty Demand
    Liu, Ming
    Liang, Bian
    Yang, Xuenan
    [J]. IFAC PAPERSONLINE, 2019, 52 (13): : 2134 - 2139
  • [4] Approximation Algorithms for Stochastic and Risk-Averse Optimization
    Srinivasan, Aravind
    [J]. PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 1305 - 1313
  • [5] Sample average approximation for risk-averse problems: A virtual power plant scheduling application
    Lima, Ricardo M.
    Conejo, Antonio J.
    Giraldi, Loic
    Le Maitre, Olivier
    Hoteit, Ibrahim
    Knio, Omar M.
    [J]. EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2021, 9
  • [6] A Chernoff Bound Approximation for Risk-Averse Integer Programming
    Cogill, Randy
    Zhou, Zhou
    [J]. 2011 AMERICAN CONTROL CONFERENCE, 2011,
  • [7] Application of a risk-averse objective function for scheduling surgeries
    Adams, T.
    O'Sullivan, M.
    Walker, C.
    Wang, K.
    Boyle, L.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2023, 151
  • [8] Risk-averse scheduling-location (ScheLoc) problem
    Liu, Ming
    Liu, Rongfan
    [J]. PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM 2019), 2019, : 278 - 283
  • [9] Risk-Averse Generation Maintenance Scheduling With Microgrid Aggregators
    Manshadi, Saeed D.
    Khodayar, Mohammad E.
    [J]. IEEE TRANSACTIONS ON SMART GRID, 2018, 9 (06) : 6470 - 6479
  • [10] A risk-averse distributionally robust project scheduling model to address
    Bruni, Maria Elena
    Hazir, Oencu
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 318 (02) : 398 - 407