OPTIMIZATION ALGORITHMS OVERVIEW FOR COURSE SCHEDULING

No Thumbnail Available

Date

2021

Journal Title

Journal ISSN

Volume Title

Publisher

СДУ хабаршысы - 2021

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.

Description

Keywords

algorithm, score, schedule, course, constraint, СДУ хабаршысы - 2021, №2

Citation

M. Zhuniskhanov , R. Suliyev / OPTIMIZATION ALGORITHMS OVERVIEW FOR COURSE SCHEDULING / СДУ хабаршысы - 2021