1. Kh, G.E., Zalyubovsky, V.V., Sevastyanov, S.V.: Polynomial solvability of scheduling problems with stored resources and deadlines. In: Discrete Analysis and Operations Research, Ser. 2, vol. 7, no. 1, pp. 9–34 (2000)
2. Kazakovtseva, E.A., Servakh, V.V.: Complexity of the scheduling problem with loans. Discrete Anal. Oper. Res. 22(4), 35–49 (2015). https://doi.org/10.17377/daio.2015.22.478
3. Servakh, V.V., Shcherbinina, T.A.: On the complexity of one scheduling problem with stored resources. Vestn. NSU. Ser. Mat. Mekh. Inform. 8(3), 105–112 (2008)
4. Servakh, V.V.: A Dynamic Programming Algorithm for Some Project Management Problems. In: Proceedings International Workshop “Discrete Optimization Methods in Scheduling and Computer-aided Design”. Minsk, pp. 90–92 (2000)
5. Romanova, A.A.: Minimizing the cost of a project schedule with renewable resources of variable cost. In: Materials of the XII International School-Symposium AMUR. Simferopol, pp. 392–396 (2018)