Adaptive search for solving hard project scheduling problems

Rainer Kolisch and Andreas Drexl

Naval Research Logistics (NRL), 1996, vol. 43, issue 1, 23-40

Abstract: 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.

Date: 1996
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199602)43:13.0.CO;2-P

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:43:y:1996:i:1:p:23-40

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().