Abstract
In this paper, the Resource Constrained Project Scheduling Problem with Discounted Cash Flows (RCPSPDC) is considered. This problem involves scheduling the project activities with cash inflows and outflows, in such a way the net present value of the cash flows is maximized subject to resource and precedence constraints. A tabu search procedure was proposed (TABU-S) as a heuristic solution technique for this problem. The procedure was, then, modified to invoke a long term memory function (TABU-L). Both procedures were tested on 50 problems derived from Patterson's data set. Solutions produced by these procedures were compared to upper bounds obtained from a Linear Programming Relaxation of RCPSPDC which is strengthened by valid cuts. Furthermore, a comparison of these solutions to solutions obtained by Minimum Slack Heuristic was provided. In general, Tabu Search successfully produced near-optimal solutions with reasonable computational effort.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
