Discrete-continuous project scheduling with discounted cash inflows and various payment models—a review of recent results

In this work discrete-continuous project scheduling problems with discounted cash flows are considered. These problems are characterized by the fact that activities of a project simultaneously require discrete and continuous resources for their execution. A class of these problems is considered, where the number of discrete resources is arbitrary, and there is one continuous, renewable resource, whose total amount available at a time is limited. Activities are non-preemptable, and the processing rate of an activity is a continuous, increasing function of the amount of the continuous resource allotted to the activity at a time. A positive cash flow (cash inflow) is associated with each activity, and the objective is to maximize the net present value (NPV). The discrete-continuous resource-constrained project scheduling problem with discounted cash flows (DCRCPSPDCF) is defined. Four payment models are considered: lump-sum payment at the completion of the project, payments at activity completion times, payments at equal time intervals, and progress payments. Some properties of optimal schedules are proved for two important classes of processing rate functions: all functions not greater than a linear function (including linear and convex functions), and concave processing rate functions. Copyright Springer Science+Business Media, LLC 2014