.png){kind=icon}
返回
A target-based distributionally robust model for the parallel machine scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2022.2053602.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We develop a distributionally robust optimisation (DRO) model based on a risk measure for the parallel machine scheduling problem (PMSP) with random job processing times. We propose an underperformance risk index (URI) to control the extent of the total weighted completion time (TWCT) that exceeds target level T. With partially characterised uncertainty set information, we transform the model with URI to its equivalent mixed-integer linear programming (MILP) counterparts. Due to the NP-hardness of PMSP with different job weights, we design a hybrid algorithm with a heuristic assignment and exact subproblem for large-scale problems. The proposed hybrid algorithm reduces the computation time significantly at the expense of solution quality. We also introduce a reformulation approach under the setting of equally weighted and identical machines. Numerical results show that our model performs better than the distributionally beta-robust optimisation models. Our proposed URI accounts for both the frequency and magnitude of violation from the target. The uncertainty set we used preserves a linear structure under partially characterised distributional information. Our computational results and sensitivity analysis show the effectiveness and efficiency of our proposed DRO model under various settings, including different problem sizes, different processing time variations, and information misalignment.
Keyword:
Scheduling
target-based
robust optimisation
distributionally robust
risk measure
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
Robust makespan minimisation in identical parallel machine scheduling problem with interval data
PREAI
分享收藏
查看更多内容