A Two Stage Search Heuristic for Scheduling Payments in Projects

When the Net Present Value (NPV) of a project is used as a measure of its financial performance, effective management of cash flows over the duration of the project is critical for improved profitability. Progress payments are a major component of project cash flows. In many project environments, the contractor can negotiate payment terms. Payments are typically tied to completion of project activities and therefore have significant impact on the schedule of activities and the timing of the payments. In this paper, we consider the problem of simultaneously determining the amount, timing and location of progress payments in projects to maximize NPV. Due to the combinatorial nature of the problem, heuristics are a practical approach to solving the problem. We propose a two-stage heuristic where simulated annealing is used in the first stage to determine a set of payments. In the second stage, activities are rescheduled to improve project NPV. We compare the performance of this general purpose heuristic with other problem-dependent heuristics from the literature. Our results indicate that the simulated annealing heuristic significantly outperforms the parameter-based heuristics. Although rescheduling in the second stage improves NPV, increases are relatively small in magnitude. While the specific parameters settings suggested by the simulated annealing heuristic in this study may have limited generalizability at this time due to the narrow range of problems tested, our analysis suggests that a pure simulated annealing approach is a very attractive alternative for obtaining good heuristic solutions to the complex problem of scheduling payments in projects. Copyright Kluwer Academic Publishers 2001