资源受限项目调度问题的最佳插入算法
Best insertion algorithm for resource-constrained project scheduling problem
摘要：
研究了资源受限项目调度问题（RCPSP）的遗传算法。首先利用随机最佳插入算法构造可行调度。构造之后是一个局部搜索，其中一个新的解决方案生成如下：首先，我们从列表中随机删除m个活动，然后按连续顺序重新插入列表中。在运行结束时，选择具有最小完工时间的调度。在PSPLIB中找到的标准测试实例上的实验工作显示了非常好的结果
英文摘要：
This paper considers heuristics for well known resource-constrained project scheduling problem (RCPSP). First a feasible schedule is constructed using randomized best insertion algorithm. The construction is followed by a local search where a new solution is generated as follows: first we randomly delete m activities from the list, which are then reinserted in the list in consecutive order. At the end of run, the schedule with the minimum makespan is selected. Experimental work shows very good results on standard test instances found in PSPLIB
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
