Abstract: Scheduling optimization of emergency rescue has an important effect on the smooth execution of rescue activities and the effective utilization of emergency resources. This paper involves the robust scheduling optimization problem of resource-constrained emergency rescue. In the problem, the robustness is defined as the sum of the products of time buffer and weight coefficient of activities, and the objective is to determine start time and performing mode of activities so as to maximize the schedule robustness under the constraints of resource availability and rescue deadline. The 0-1 programming optimization model of the problem is constructed and in view of its NP-hardness, a two-loop tabu search heuristic algorithm is developed based on the characteristic of the problem. Ultimately, an instance is calculated and analyzed and the following conclusion is drawn: Given the network structure and time parameters of the emergency rescue, the time buffer can be assigned to the important activities through the definition of their weight coefficients, thus improving the schedule robustness effectively; the schedule robustness tends to ascend with the increase of the resource availability and as the rescue deadline extends, the schedule robustness climbs monotonously. The research in this paper can provide decision supports for the preparation of the base schedule of emergency rescue.

Key words: robust scheduling, emergency rescue, optimization model, tabu search heuristic algorithm, resource constraints

摘要： 突发事件应急救援的调度优化,对于救援活动的顺利实施及应急资源的有效使用具有至关重要的作用。本文研究资源约束下的突发事件应急救援鲁棒性调度优化问题,其中,鲁棒性定义为各活动的时间缓冲与其权重系数乘积的总和,目标是在资源可用量及救援期限的约束下,安排活动开始时间和执行模式以最大化应急救援计划的鲁棒性。作者构建了问题的0-1规划优化模型,针对其NP-hard属性,基于问题特征设计双环路禁忌搜索启发式算法。通过对一个算例的计算分析,得到如下结论:给定网络结构及时间参数,利用权重系数的定义可以将时间缓冲分配到重要活动上,由此提高应急救援计划的鲁棒性;随着资源可用量的增加,计划的鲁棒性呈上升趋势,而当救援期限延长时,计划的鲁棒性单调增加。本文研究可为突发事件应急救援基准计划的制定提供决策支持。

关键词: 鲁棒性调度, 突发事件应急救援, 优化模型, 禁忌搜索启发式算法, 资源约束