Paper Info
Title
An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations
Abstract
In this paper, we consider the resource-constrained project scheduling problem (RCPSP) with discounted cash flows and generalized precedence relations (RCPSPDC-GPR). The RCPSPDC-GPR extends the RCPSP to (a) arbitrary minimal and maximal time lags between the starting and completion times of activities and (b) the non-regular objective function of maximizing the net present value of the project with positive and/or negative cash flows associated with the activities. To the best of our knowledge, the literature on the RCPSPDC-GPR is completely void. We present a depth-first branch-and-bound algorithm in which the nodes: in the search tree represent the original project network extended with extra precedence relations which resolve a number of resource conflicts. These conflicts are resolved using the concept of minimal delaying modes, which is an extension of the notion of minimal delaying alternatives originally developed for the RCPSP. An upper bound on the project net present value as well as several dominance rules are used to fathom large portions of the search tree. Extensive computational experience on a randomly generated benchmark problem set is reported. (C) 1997 Elsevier Science Ltd.
Year
DOI
Venue
1998
10.1016/S0305-0548(98)00005-7
Computers & OR
Keywords
DocType
Volume
resource-constrained project scheduling problem,optimal procedure,generalized precedence relation,discounted cash flow
Journal
25
Issue
ISSN
Citations 
1
0305-0548
11
PageRank 
References 
Authors
1.66
0
2
Name
Order
Citations
PageRank
Bert De Reyck154746.23
Willy Herroelen299474.39