|
|
|
|
References
|
|
| |
| 1. |
Gimadi E. Kh. and Puzynina N. M., “Problem of the calendar planning of a large-scale design under the conditions of limited resources: experience in the construction of software”, Upravliaemie Systemy, 1983, no. 23, 24–32 (in Russian) |
| 2. |
Gimadi E. Kh., Zalyubovskii V. V., and Sevast'yanov S. V., “Polynomial solvability of scheduling problems with storable resources and directive deadlines”, Diskretn. Anal. Issled. Oper., Ser. 2, 7:1 (2000), 9–34 (in Russian)   |
| 3. |
Goncharov E. N. and Leonov V. V., “Genetic algorithm for the resource-constrained project scheduling problem”, Avtomatika i Telemekhanika, 2017, no. 6, 173–179 (in Russian) |
| 4. |
Goncharov E. N. and Mishin D. V., “Exact algorithm for the resource-constrained project scheduling problem”, Prikladnaya Matematika i Fundamental'naya Informatika, 4:1 (2017), 43–53 (in Russian) |
| 5. |
Hartmann S. and Briskorn D., “An updated survey of variants and extensions of the resource-constrained project scheduling problem”, Eur. J. Operat. Res., 2022, no. 1, 1–14  |
| 6. |
Habibi F., Barzinpour F., and Sadjadi S., “Resource-constrained project scheduling problem: review of past and recent developments”, J. Project Management, 3:2 (2018), 55–88 |
| 7. |
Kazakovtseva E. A. and Servakh V. V., “Complexity of the project scheduling problem”, Diskretn. Analiz i Issled. Oper., 22:4 (2015), 35–49 (in Russian) |
| 8. |
Servakh V. V. and Soukhikh S. L., “Hybrid algorithm for scheduling with regard for reinvestment of profits”, Avtomatika i Telemekhanika, 2004, no. 3, 100–107 (in Russian) |
| 9. |
Bulavchuk A. M. and Semenova D. V., “Genetic algorithm based on idempotent algebra methods for RCPSP”, IEEE 15th Intern. Conf. AICT, 2021, 1–4 |
| 10. |
Litvinov G. L., Maslov V. P., and Sobolevsky A. N., “Idempotent mathematics and interval analysis”, Vychislitel'nye Tekhnologii, 6:6 (2001), 41–70 (in Russian) |
| 11. |
Krivulin N. K., Methods of Idempotent Algebra in Problems of Complex Systems Modeling and Analysis, St. Petersburg University Press, St. Petersburg, 2009, 255 pp. (in Russian) |
| 12. |
Omelchenko A. V., Graph Theory, MCCME Publ., M., 2018, 416 pp. (in Russian) |
| 13. |
Kochetov Y. A. and Stolyar A. A., “New greedy euristics for the the resource constrained project scheduling problem”, Diskretn. Analiz i Issled. Oper., 12:1 (2005), 12–36 (in Russian) |
| 14. |
Project scheduling problem library, https://www.om-db.wi.tum.de/psplib/, 2022 |
