.png){kind=icon}
返回
Service-oriented robust parallel machine scheduling
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2018.1497311.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Stochastic scheduling optimisation is a hot and challenging research topic with wide applications. Most existing works on stochastic parallel machine scheduling address uncertain processing time, and assume that its probability distribution is known or can be correctly estimated. This paper investigates a stochastic parallel machine scheduling problem, and assumes that only the mean and covariance matrix of the processing times are known, due to the lack of historical data. The objective is to maximise the service level, which measures the probability of all jobs jointly completed before or at their due dates. For the problem, a new distributionally robust formulation is proposed, and two model-based approaches are developed: (1) a sample average approximation method is adapted, (2) a hierarchical approach based on mixed integer second-order cone programming (MI-SOCP) formulation is designed. To evaluate and compare the performance of the two approaches, randomly generated instances are tested. Computational results show that our proposed MI-SOCP-based hierarchical approach can obtain higher solution quality with less computational effect.
Keyword:
scheduling
stochastic optimisation
distributionally robust
ambiguous processing time
service level
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
Tetrahydrocannabinol in Behavioral Disturbances in Dementia: A Crossover Randomized Controlled Trial
PREAI
分享收藏分享收藏
Robust makespan minimisation in identical parallel machine scheduling problem with interval data
PREAI
分享收藏
查看更多内容