Development and Implementation of an Automation Algorithm for Class Scheduling Process at Universities

2019

Closed access Metadata (CSL-JSON)
DOI 10.1109/sibircon48586.2019.8958249
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Due to the improvement of university management system based on computer and information systems, the issue of class scheduling automation has become increasingly relevant. The solution to the problems of compiling various types of schedules belongs to a special field of applied mathematics - the theory of schedules. However, the solution to this problem heavily depends on the specifics of a particular university. This means that scheduling requires the development of “flexible” methods and algorithms that should more or less take into account the specifics of each university. This article provides an overview of the available methods and algorithms used in scheduling classes and describes the development and implementation of an algorithm that would solve the task of forming the optimal university class schedule based on the genetic algorithm.