Multi-mode project selection, scheduling and resource allocation with time dependent returns

In this paper, we address the problem of multi-mode project selection and scheduling with time-dependent returns. We first develop a mathematical model to formulate the problem, followed by the introduction of a branch-and-bound algorithm designed to solve it. To enhance the efficiency of the implicit enumeration algorithm, we incorporate several fathoming techniques and priority rules. Finally, the performance of the algorithm is evaluated in a numerical example.