<Repository logo
  • English
  • Қазақ
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  • English
  • Қазақ
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
Repository logo
  • Communities & Collections
  • All of SDU repository
  • GuideRegulations
  1. Home
  2. Browse by Author

Browsing by Author "Zhuniskhanov M."

Now showing 1 - 3 of 3
Results Per Page
Sort Options
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Analysis of Course Schedule Generation Tool and Its Integration to University Automation System
    (Faculty of Engineering and Natural Science, 2020) Zhuniskhanov M.
    This research examines the university course schedule generation problem. It begins with the definition of the inconveniences of the old system. Then determine the importance of reducing the resource usage while integrating with the university automation system. This discussion integrates with an overview of the problem itself both from practical and academic perspectives. Then course schedule generation algorithms discussed with the ways of implementing it. This is followed by benchmark and resource usage comparison.
  • Loading...
    Thumbnail Image
    ItemOpen Access
    IMPLEMENTING COURSE SCHEDULE GENERATION APPLICATION FOR UNIVERSITY
    (СДУ хабаршысы - 2021, 2021) Zhuniskhanov M. ; Suliyev R.
    Abstract. This work is about researching and implementing Course Schedule Generation Application for university. She compares other similar applications in this area and explores important points. Through UML diagrams, important concepts and development progress are explained. Screenshots of using the application will also be provided. Dataset, configuration and rules explained. In the end, we will talk about the importance of such an application and facilitate planning for the university.
  • Loading...
    Thumbnail Image
    ItemOpen Access
    OPTIMIZATION ALGORITHMS OVERVIEW FOR COURSE SCHEDULING
    (СДУ хабаршысы - 2021, 2021) Zhuniskhanov M. ; Suliyev R.
    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.

Find us

  • SDU Scientific Library Office B203,
  • Abylaikhana St. 1/1 Kaskelen, Kazakhstan

Call us

Phone: +7 (727) 307 9565 (Int. 183)

Mail us

E-mail: repository@sdu.edu.kz
logo

Useful Links

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback

Follow us

Springshare
ROAR
OpenDOAR

Copyright © 2023, All Right Reserved SDU University