Se. Sampson et En. Weiss, LOCAL SEARCH TECHNIQUES FOR THE GENERALIZED RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM, Naval research logistics, 40(5), 1993, pp. 665-675
Citations number
37
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science
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 gua
rantees precedence feasibility, allowing the procedure to focus on ove
rcoming resource infeasibility. We use the 110-problem data set of Pat
terson to test our procedure. Our results indicate a significant impro
vement over the best heuristic results reported to date for these prob
lems (Bell and Han [1]). Two major advantages of the local search algo
rithm are its ability to handle arbitrary objective functions and cons
traints and its effectiveness over a wide range of problem sizes. We p
resent a problem example with an objective function and resource const
raints which include nonlinear and noncontinuous components, which are
easily considered by the procedure. The results of our algorithm are
significantly better than random solutions to the problem. (C) 1993 Jo
hn Wiley & Sons, Inc.