资源有限-工期最短的随机搜索算法优化研究

在分析了“资源有限-工期最短”问题的现行研究方法基础上，针对其中序列法的优先系数公式，提出了用随机优先度代替现有公式计算出来的优先权系数。结合拓扑排序，得到工程网络活动的若干单一顺序序列，用调度算法程序计算序列在资源限制条件下，以最短的工期作为目标问题的近似最优解。通过实例计算与分析，结果与现行方法相差无几。

Research of the Resource-Constrained Project Scheduling with Random Search Algorithm

After having analyzed the current research approaches for resource-constrained project scheduling, against the priority coefficient formula in the Serial Algorithm, presented a new method for this problem. First, get the sequences of the activities of the network with the topological sort and the random priority instead of the priority coefficient, which was calculated by the Existing formula, then calculate the durations of the sequences by the scheduling procedure with the condition of the resource-constrained, the third take the minimum duration as the approximate optimum solution for the problem. According to the analyzing of the calculation results, it is neatly the same between the results by new method and the results by the present method.