关键词: 反应性项目调度, 优化模型, 禁忌搜索, 活动执行时间可提前, 多模式

Abstract: This study investigates reactive disruptions and aims at the selection of the proper activity modes and the determination of starting times based on roadrunner policy. An overview on reactive scheduling under uncertainty is discussed at first, and then the mathematical formulation is established. Based on the NP-hardness of the problem, a tabu search algorithm is developed. Ultimately, a practical case is used to illustrate the research. The results show that the reactive cost and makespan of the project based on the roadrunner policy are both lower than those depending on railway policy. During the execution progress, the cost and number of disrupted activities both decrease gradually, and the completion time does not change at certain time instants. For activities with large duration increase, it is effective to reduce cost by arranging themselves or their predecessors ahead of the planned starting times or switching modes to the one with shorter durations. This research provides decision support for the project manager to resolve the disruptions under uncertainty.

Key words: reactive project scheduling, optimization model, tabu search, roadrunner policy, multi-mode