OPTIMIZATION ALGORITHMS OVERVIEW FOR COURSE SCHEDULING
| dc.contributor.author | Zhuniskhanov M. | |
| dc.contributor.author | Suliyev R. | |
| dc.date.accessioned | 2023-12-14T03:14:51Z | |
| dc.date.available | 2023-12-14T03:14:51Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract | Abstract. Today we have a lot of optimization algorithms that can be used for course scheduling, but the main question is which of them fulfills our requirements better and what are the advantages of one from the others. Since course scheduling is an NP-problem, in this article we will look at a few of algorithms that are used to solve different problems and have proved themselves only on the best side and compare their main advantages. When comparing, we will rely not only on the accuracy of the results, but also on the speed of solving complex problems, and on solving complex conditions. | |
| dc.identifier.citation | M. Zhuniskhanov , R. Suliyev / OPTIMIZATION ALGORITHMS OVERVIEW FOR COURSE SCHEDULING / СДУ хабаршысы - 2021 | |
| dc.identifier.issn | 2709-2631 | |
| dc.identifier.uri | https://repository.sdu.edu.kz/handle/123456789/981 | |
| dc.language.iso | en | |
| dc.publisher | СДУ хабаршысы - 2021 | |
| dc.subject | algorithm | |
| dc.subject | score | |
| dc.subject | schedule | |
| dc.subject | course | |
| dc.subject | constraint | |
| dc.subject | СДУ хабаршысы - 2021 | |
| dc.subject | №2 | |
| dc.title | OPTIMIZATION ALGORITHMS OVERVIEW FOR COURSE SCHEDULING | |
| dc.type | Article |