求解紧急事件调度资源水平问题的启发式算法  

Heuristic algorithm for resource leveling problem in emergency scheduling

作　　者：梁燕[1] 金烨[1] 

机构地区：[1]上海交通大学计算机集成制造研究所,上海200240

出　　处：《计算机集成制造系统》2009年第6期1165-1171,共7页Computer Integrated Manufacturing Systems

基　　金：国防科工委重大科研资助项目(708T00007)。~~

摘　　要：为求解紧急事件调度中的资源水平问题,设计了一种启发式算法。鉴于紧急事件调度的紧迫性特点,首先在不考虑资源约束的基础上确定项目的初始关键链;然后根据初始关键链中任务的最早及最晚开始时间,建立了基于任务紧迫性的启发式规则,求解资源冲突;最后结合初始关键链与启发式规则,开发了基于任务紧迫性的启发式算法。算法目标是在给定项目工期条件下,获得最低的资源配置及对应的调度序列。与现有算法进行比较,试验结果表明,设计的启发式算法可以获得更好的解,更适用于紧急事件调度问题。To solve resource leveling problem in emergency scheduling, a heuristic algorithm was developed. Firstly, an initial critical chain was defined without considering resource constraints. Then, according to the earliest and latest start time of tasks in the initial critical chain, several urgency-based heuristic rules were proposed to solve resource conflicts. Finally, combing the initial critical chain and heuristic rules, an urgency-based heuristic algorithm was developed. The objective of the algorithm was to obtain the lowest resource configuration and corresponding scheduling within settled project duration. The experiment results showed that the proposed heuristic algorithm could obtain better results by comparing to the existing algorithms, and was more applicable to emergency scheduling problems.

关 键 词：资源水平 资源限制 启发式算法 关键链 紧急事件 

分 类 号：C934[经济管理—管理学]