多资源区间连续消耗应急调度问题研究

Study on Emergency Scheduling Problemwith Multiple Resource Intervals and Continuous Consumption

考虑多资源组合应急调度问题,目标为在满足各类物资正常供给的情况下求解最早应急开始时间。针对多个出救点,且各类资源在区间上连续消耗的情况,研究最早应急开始时间应满足的性质,由此给出求解问题的多项式时间算法,并通过实例验证了算法的有效性。

In this paper we considered the emergency scheduling of multiple resource combinations, the objective of which was to obtain the earliest possible commencing time while satisfying the normal supply of various goods. In view of the circumstances where there were multiple service points and the resources were consumed continuously within an interval, we studied the requirement to be complied with for the earliest commencing time, solved accordingly the polynomial time algorithm of the problem and through an empirical example demonstrated the validity of the algorithm.