Automation of the Creation of the Schedule at the University: Mathematical Model

• R.I. KHABIPOV Kazan Federal University, Kazan, Tatarstan Republic

Palabras clave: Algorithms of integer linear programming, class schedule, educational plans, scheduling. / Algoritmos de programación lineal entera, horario de clases, planes educativos, programación.

Resumen

ABSTRACT

 

The work aims to describe a mathematical model of the automation of the scheduling process in an educational institution. Also, the approaches to the compilation of the optimal schedule are considered. In the studied tasks, a large amount of initial original information is used, which differs in its composition, and contains a large number of requirements that must be taken into account. Therefore, scheduling refers to the class of NP-complete integer programming problems, which implies that as the number of values of given variables increases, the complexity of the solution will grow exponentially.

 

RESUMEN

 

El objetivo del trabajo es describir un modelo matemático de la automatización del proceso de programación en una institución educativa. También se consideran los enfoques para la compilación del horario óptimo. En las tareas estudiadas se utiliza una gran cantidad de información original inicial, que difiere en su composición, y contiene una gran cantidad de requisitos que deben tenerse en cuenta. Por lo tanto, la programación se refiere a la clase de problemas de programación de enteros NP-completos, lo que implica que a medida que aumenta el número de valores de variables dadas, la complejidad de la solución crecerá exponencialmente.

 

Citas

AZAMI, A, DEMIRLI, K, & BHUIYAN, N (2018). “Scheduling in aerospace composite manufacturing systems: a two-stage hybrid flow shop problem”. The International Journal of Advanced Manufacturing Technology, 95(9-12), pp. 3259-3274.

CONWAY, RV, MAXWELL, VL, MILLER, LV (1975). “Theory of schedules”. Moscow: Science. p. 360.

GAWIEJNOWICZ, S (2020). “The classical scheduling theory”. In Models and Algorithms of Time-Dependent Scheduling, pp. 47-63. Springer, Berlin, Heidelberg.

GRANKOV, MV, AL-GABRI, VM, & GORLOVA, MY (2016). “Analysis and clustering of the main factors affecting the academic performance of university groups”. Engineering Bulletin of the Don, (4).

IVANCO, M, HOU, G, & MICHAELI, J (2017). “Sensitivity analysis method to address user disparities in the analytic hierarchy process”. Expert Systems with Applications, 90, pp. 111-126.

IVANOV, D, SOKOLOV, B, & DOLGUI, A (2020). “Introduction to Scheduling in Industry 4.0 and Cloud Manufacturing Systems”. In Scheduling in Industry 4.0 and Cloud Manufacturing, pp. 1-9. Springer, Cham.

RUSTAULETOV, B (2020). “The Automation of Course Scheduling in Higher Education Institutions: Mathematical methods and software products”. In Proceedings of International Young Scholars Workshop (Vol. 9).

SHA, L, ABDELZAHER, T, CERVIN, A, BAKER, T, BURNS, A, BUTTAZZO, G, ... & MOK, AK (2004). “Real-time scheduling theory: A historical perspective”. Real-time systems, 28(2-3), pp. 101-155.

TANAEV, V, GORDON, W, & SHAFRANSKY, YM (2012). “Scheduling theory. Single-stage systems (Vol. 284)”. Springer Science & Business Media.

TANAEV, VS, & SHKURBA, VV (1975). “Introduction to scheduling theory”. Nauk~, Moscow.

T'KINDT, V, & BILLAUT, JC (2006). “Multicriteria scheduling: theory, models and algorithms”. Springer Science & Business Media.