.png){kind=icon}
返回
Two-stage stochastic/robust scheduling based on permutable operation groups
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-023-05639-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we study the performance of a two-stage approach to scheduling under uncertainty making use of sequences of groups of permutable operations. Given a sample set of uncertainty realization scenarios, the goal is to compute a sequence of groups of permutable operations representing a partial scheduling decision in the first-stage, that yields the best possible score in the second-stage, when, for a specific scenario, a full operation sequence is obtained via a second-stage decision policy. This approach is described for a single-machine problem and the jobshop problem with stochastic and robust optimization, as well as several commonly studied objectives. We propose new constraint programming models as well as a genetic algorithm meta-heuristic to compute such two-stage solutions. We also investigate a warm-start scheme to work around the difficult search space of sequences of permutable operations. Experiments are carried out to characterize when this two-stage approach yields better results. We also compare the introduced methods with existing ones. Theoretical extensions of the known methods are also described and evaluated.
Keyword:
Stochastic and robust 2-stage scheduling
Permutable operation groups
Constraint programming
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
.png){kind=icon}
Effects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
PREAI
分享收藏Target-Specific Delivery of an Antibody That Blocks the Formation of Collagen Deposits in Skin and Lung靶向递送一种阻断皮肤和肺中胶原沉积的抗体的方法
OAAI
OAAI分享收藏Evolutionary Learning Based Simulation Optimization for Stochastic Job Shop Scheduling Problems
PREAI
分享收藏
查看更多内容