带有缓冲区的资源受限调度问题的滚动时域求解算法

Efficient rolling horizon algorithms for resources-constrained scheduling problems with buffers

研究带有缓冲区的资源受限调度问题,设计了两种使用滚动时域策略的启发式算法TWBA和FWBA,通过依次处理一定量任务,尽可能使得调度所产生的费用最小.为了评估算法性能,进行了大量模拟研究,在不同条件下找出相应的最优的处理周期或者是最优决策时刻,仿真结果表明了新算法在应用中有较好的性能,并且得到比在线算法更优的调度结果.

This paper aims at solving resources-constrained scheduling problems with buffers. Two new heuristic algorithms using rolling-horizon strategy were proposed to minimizing the cost of scheduling. To evaluate the efficiency of presented algorithms, experimentations are taken in order to obtain the corresponding optimal decision-making period. Simulation results indicate that the new algorithms show better performance in real time applications than online algorithms.