On optimization of R&D Project Selection and Scheduling

There is discussed the multi-period problem of project selection and scheduling for research and development (R&D) projects. The problem is a NP-hard RCPSP problem with discrete time periods (weeks), available budget constraints, deadlines, interruption of stages and dynamic change of initial data. Due to this peculiarities and the computational complexity, splitting the problem into series of subproblems for each period is proposed. These subproblems can be solved using GPU programming.