Adaptive search for solving hard project scheduling problems
Adaptive search for solving hard project scheduling problems
复制标题
DOI：
10.1002/(sici)1520-6750(199602)43:1
复制
发表时间：
1996-02
影响因子：
2.3
通讯作者：
R. Kolisch;A. Drexl
中科院分区：
文献类型：
--
作者：
R. Kolisch;A. Drexl
在本文中，我们提出了一种新的启发式解决方法来解决资源受限的项目调度问题。基本上，它是优先级规则和随机搜索技术的混合，采用两种类型的适应来确定解决方案空间。我们通过使用一个新的优先级规则和下界技术来增强这个一般方案。通过将该方法与其他最近提出的启发式方法在广泛使用的基准实例集上进行比较，对该方法进行了评估。此外，我们还证明了该方法可以有效地应用于解决项目调度领域的各种难题。©1996 John Wiley & Sons, Inc
In this article we propose a new heuristic solution technique for resource‐constrained project scheduling problems. Basically, it is a hybrid of priority rule and random search techniques which employs two types of adaptations in order to determine the solution space. We enhance this general scheme by the use of a new priority rule and by lower bounding techniques. The method is evaluated by comparing it with other recently proposed heuristics on a widely used set of benchmark‐instances. Furthermore, we show that the procedure can be usefully applied to solve different hard problems within the field of project scheduling. © 1996 John Wiley & Sons, Inc.