arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.4595cs.AI
收藏

鲁棒局部搜索求解具有持续时间不确定性的RCPSP/max

Robust Local Search for Solving RCPSP/max with Durational Uncertainty

Singapore Management University(新加坡管理大学);Google Inc.(谷歌公司)

Na Fu, Hoong Chuin Lau, Pradeep R. Varakantham, Fei Xiao

摘要:

制造、物流和项目管理中的调度问题经常被建模为具有最小和最大时间滞后的资源受限项目调度问题(RCPSP/max)。由于这些问题的重要性,为RCPSP/max问题提供可扩展的解决方案是一个广泛研究的主题。然而,所有现有的方法解决RCPSP/最大假设的持续时间的活动是已知的确定性,一个假设,不举行在现实世界中的调度问题,意外的外部事件,如人力资源,天气变化等,导致延迟或提前完成的活动。因此,在本文中,我们的重点是提供一个可扩展的方法来解决RCPSP/最大持续时间的不确定性问题。为此,我们引入了鲁棒局部搜索方法,该方法包括三个关键思想:(a)引入并研究了两种用于计算活动开始时间的决策规则近似的性质:(b)推导了基于决策规则近似的执行策略的鲁棒完工时间表达式;以及(c)鲁棒的本地搜索机制,以有效地计算对持续时间不确定性鲁棒的活动执行策略。此外,我们还提供了增强本地搜索,利用活动之间的时间依赖性。我们的实验结果表明,鲁棒局部搜索能够有效地提供鲁棒的执行策略。

英文摘要:

Scheduling problems in manufacturing, logistics and project management have frequently been modeled using the framework of Resource Constrained Project Scheduling Problems with minimum and maximum time lags (RCPSP/max). Due to the importance of these problems, providing scalable solution schedules for RCPSP/max problems is a topic of extensive research. However, all existing methods for solving RCPSP/max assume that durations of activities are known with certainty, an assumption that does not hold in real world scheduling problems where unexpected external events such as manpower availability, weather changes, etc. lead to delays or advances in completion of activities. Thus, in this paper, our focus is on providing a scalable method for solving RCPSP/max problems with durational uncertainty. To that end, we introduce the robust local search method consisting of three key ideas: (a) Introducing and studying the properties of two decision rule approximations used to compute start times of activities with respect to dynamic realizations of the durational uncertainty; (b) Deriving the expression for robust makespan of an execution strategy based on decision rule approximations; and (c) A robust local search mechanism to efficiently compute activity execution strategies that are robust against durational uncertainty. Furthermore, we also provide enhancements to local search that exploit temporal dependencies between activities. Our experimental results illustrate that robust local search is able to provide robust execution strategies efficiently.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑