Target-based distributionally robust optimization for single machine scheduling

被引:14
|
作者
Pei, Zhi [1 ]
Lu, Haimin [1 ]
Jin, Qingwei [2 ]
Zhang, Lianmin [3 ,4 ]
机构
[1] Zhejiang Univ Technol, Coll Mech Engn, Hangzhou 310023, Peoples R China
[2] Zhejiang Univ, Sch Management, Hangzhou 310023, Peoples R China
[3] Nanjing Univ, Sch Management & Engn, Nanjing 210093, Peoples R China
[4] Shenzhen Res Inst Big Data, Shenzhen 518172, Peoples R China
基金
中国国家自然科学基金;
关键词
Scheduling; Target; -based; Distributionally robust optimization; Risk measure; CVaR; PARALLEL MACHINES; TOTAL TARDINESS; TARDY JOBS; MINIMIZE; NUMBER; RISK; TIMES;
D O I
10.1016/j.ejor.2021.08.034
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In the traditional single-machine scheduling problem with uncertain processing time, distributionally robust optimization models are established in situations where the distribution information is not known exactly. One well-studied robust optimization method used in scheduling is the distributionally beta-robust optimization technique. The goal of this technique is to maximize the probability that the total flow time of the job sequence does not exceed the predetermined target level T . However, it is possible that the excess value of the total flow time beyond the target T may be incredibly large, and therefore it is necessary to consider the optimized excess value. To address this concern, two new target-based risk measures are introduced. First, target-oriented CVaR, the worst-case conditional value-at-risk (CVaR) is used to minimize the excess value beyond T , which accounts for both the excess probability and the excess value. Second, the essential riskiness index (ERI) is extended to a multi-piecewise linear function for excess value control in single-machine scheduling problems. To obtain a tractable closed-form solutions of the risk measures, the CVaR-based measure is decomposed into an assignment problem and a second-order cone programming problem, and the ERI is converted to its equivalent semi-definite programming and second-order cone counterparts. To efficiently solve the risk measures for single-machine scheduling, a bisection search algorithm and a Benders decomposition algorithm are designed. In the numerical analysis, the excess value and the probability are investigated with respect to two distributions, namely the two-point distribution and the truncated normal distribution. The experiment design also considers different ranges of expectation and variance, tolerance levels, and problem scales. It is discovered that the CVaR and ERI-based methods are always better than the distributionally beta-robust scheduling approach in terms of excess value.
引用
收藏
页码:420 / 431
页数:12
相关论文
共 50 条
  • [1] A target-based distributionally robust model for the parallel machine scheduling problem
    Li, Yuanbo
    Kuo, Yong-Hong
    Li, Runjie
    Shen, Houcai
    Zhang, Lianmin
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2022, 60 (22) : 6728 - 6749
  • [2] Target-based project crashing problem by adaptive distributionally robust optimization
    Li, Yuanbo
    Cui, Zheng
    Shen, Houcai
    Zhang, Lianmin
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 157
  • [3] Distributionally robust resource constrained single machine scheduling
    Liu, Ming
    Liu, Xin
    [J]. PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM 2019), 2019, : 130 - 135
  • [4] Distributionally robust single machine scheduling with risk aversion
    Chang, Zhiqi
    Song, Shiji
    Zhang, Yuli
    Ding, Jian-Ya
    Zhang, Rui
    Chiong, Raymond
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 256 (01) : 261 - 274
  • [5] Single machine scheduling with release dates: A distributionally robust approach
    Lu, Haimin
    Pei, Zhi
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 308 (01) : 19 - 37
  • [6] Distributionally robust single machine scheduling with the total tardiness criterion
    Niu, Shengsheng
    Song, Shiji
    Ding, Jian-Ya
    Zhang, Yuli
    Chiong, Raymond
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2019, 101 : 13 - 28
  • [7] Balancing the profit and capacity under uncertainties: a target-based distributionally robust knapsack problem
    Ding, Jianpeng
    Chen, Liuxin
    Ke, Ginger Y.
    Li, Yuanbo
    Zhang, Lianmin
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (02) : 760 - 782
  • [8] Wasserstein distance-based distributionally robust parallel-machine scheduling *
    Yin, Yunqiang
    Luo, Zunhao
    Wang, Dujuan
    Cheng, T. C. E.
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2023, 120
  • [9] Distributionally robust optimization for planning and scheduling under uncertainty
    Shang, Chao
    You, Fengqi
    [J]. COMPUTERS & CHEMICAL ENGINEERING, 2018, 110 : 53 - 68
  • [10] A distributionally robust optimization approach for outpatient colonoscopy scheduling
    Shehadeh, Karmel S.
    Cohn, Amy E. M.
    Jiang, Ruiwei
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 283 (02) : 549 - 561