Optimal resource profiles for program scheduling
The author formulates the problem of maximizing the total net present value of a program consisting of a series of parallel projects. Each project is characterized by a total cost function and a time interval for its duration. Moreover, the completion of every set of parallel projects generates a discounted benefit. A method based on dynamic programming is proposed for solving the problem. The lack of some details concerning the method may cause that it can be obscure for less advanced readers. The described results of application seem to be very encouraging.
scientific article; zbMATH DE number 3997547
scientific article