Answers are grounded in this paper and cite their sources.
Research reveals NP-hard nature of project scheduling with accumulative resources, implying complexities ahead.
We consider the Project Scheduling Problem with accumulative resources of timedependent cost and the case of limited storage. We prove its NP-hardness in a strong sense. Also a dynamic programming algorithm has been developed and pseudopolynomially solvable cases have been identified.
No takes yet. Share an insight, caveat, or question.
А. А. Романова (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: