Local search techniques for the generalized resource constrained project scheduling problem

Scott E. Sampson and Elliott N. Weiss

Naval Research Logistics (NRL), 1993, vol. 40, issue 5, 665-675

Abstract: In this article we address the problem of scheduling a single project network with both precedence and resource constraints through the use of a local search technique. We choose a solution definition which guarantees precedence feasibility, allowing the procedure to focus on overcoming resource infeasibility. We use the 110‐problem data set of Patterson to test our procedure. Our results indicate a significant improvement over the best heuristic results reported to date for these problems (Bell and Han [1]). Two major advantages of the local search algorithm are its ability to handle arbitrary objective functions and constraints and its effectiveness over a wide range of problem sizes. We present a problem example with an objective function and resource constraints which include nonlinear and non‐continuous components, which are easily considered by the procedure. The results of our algorithm are significantly better than random solutions to the problem. © 1993 John Wiley & Sons, Inc.

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

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199308)40:53.0.CO;2-J

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:40:y:1993:i:5:p:665-675

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 ().