提出三种新方法优化带最大时间约束的随机项目调度问题。
Proactive and Reactive Constraint Programming for Stochastic Project Scheduling with Maximal Time-Lags
- 基于约束编程构建完全主动调度方案
- 采用在线重调度实现反应式策略，提升应对不确定性能力
- 结合不确定时序网络，兼顾解质量与计算效率
本研究针对带有最大时间滞后约束的随机资源受限项目调度问题（SRCPSP/max），探讨多种主动与反应式调度策略。首先提出一种基于约束编程的全主动调度方法；其次展示如何通过在线重调度构建反应式方案；第三项贡献基于部分有序调度，利用不确定时序网络（STNUs）。统计分析表明，基于STNU的算法在解质量上表现最优，同时具备良好的离线与在线计算时间性能。
原文摘要 · Abstract (English)
This study investigates scheduling strategies for the stochastic resource-constrained project scheduling problem with maximal time lags (SRCPSP/max)). Recent advances in Constraint Programming (CP) and Temporal Networks have reinvoked interest in evaluating the advantages and drawbacks of various proactive and reactive scheduling methods. First, we present a new, CP-based fully proactive method. Second, we show how a reactive approach can be constructed using an online rescheduling procedure. A third contribution is based on partial order schedules and uses Simple Temporal Networks with Uncertainty (STNUs). Our statistical analysis shows that the STNU-based algorithm performs best in terms of solution quality, while also showing good relative offline and online computation time.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。