Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach

Published Online:https://doi.org/10.1287/mnsc.23.8.882

A zero-one integer programming formulation of the project scheduling problem is reported which maximizes the discounted value of cash flows in a project when progress payments and cash outflows are made upon the completion of certain activities. While this problem has been treated previously, it has not been addressed in a manner which allows for the type of constraints treated in this paper. And while cash can be treated as any other resource in the noncash flow, resource-constrained version of this problem, the effects of cash inflows and outflows and the time sequencing alternatives for them allow for a different treatment of cash resources than has been previously reported.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.