In this paper, we present a new genetic algorithm for the resource-constrained project scheduling problem with discounted cash flows and investigate the trade-off between a project’s net present value and its corresponding lead time. We consider a problem formulation where the pre-specified project deadline is not set as a hard constraint, but rather as a soft constraint that can be violated against a certain penalty cost. The genetic algorithm creates children from parents taken from three different populations, each containing relevant information about the (positive or negative) activity cash flows. We have tested various parent selection methods based on four crossover operators taken from literature and present extensive computational results.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: