SISTEM ZA OPTIMIZACIJU RASPOREDA NASTAVE FAKULTETA TEHNIČKIH NAUKA
Ključne reči:
sistem baziran na pravilima, problem planiranja rasporeda, predstava domenskog znanja
Apstrakt
U sklopu ovog rada dizajniran je i implementiran sistem za optimizaciju rasporeda nastave, sa posebnim fokusom na organizacionu strukturu Fakulteta tehničkih nauka. Opisan je domen problema, korisnički zahtevi i arhitektura sistema, dat je pogled na implementaciju sistema, kao i moguća unapređenja sistema. Rezultat rada jeste softver koji pruža mogućnost optimizacije rasporeda nastave koji je dodatno integrisan u širi sistem. Širi sistem omogućava korisniku upravljanje celim tokom, od ulaznih podataka, preko optimizacije i zaključno sa kreiranjem rasporeda u različitim formatima.
Reference
[1] Häfner, A., Stock, A., & Oberst, V. (2015). Decreasing students’ stress through time management training: An intervention study. European journal of psychology of education, 30, 81-94.Jackson, P. (1986). Introduction to expert systems.
[2] Jacob, R. J. K., & Froscher, J. N. (1990). A software engineering methodology for rule-based systems. IEEE Transactions on Knowledge and Data Engineering, 2(2), 173-189.
[3] Jackson, P. (1986). Introduction to expert systems.
[4] Tакмичење у оптимизацији распореда наставе за 2019. годину, https://www.itc2019.org/home [датум приступа август 2023]
[5] Wren, A. (1995, August). Scheduling, timetabling and rostering—a special relationship?. In International conference on the practice and theory of automated timetabling (pp. 46-75). Berlin, Heidelberg: Springer Berlin Heidelberg.
[6] Kristiansen, S., & Stidsen, T. R. (2013). A comprehensive study of educational timetabling—A survey. Department of Management Engineering, Technical University of Denmark. DTU Management Engineering Report, 8.
[7] Al-Betar, M. A., Khader, A. T., & Liao, I. Y. (2010). A harmony search with multi-pitch adjusting rate for the university course timetabling. Recent advances in Harmony search algorithm, 147-161.
[8] Garey, M. R., & Johnson, D. S. (1979). Computers and intractability. A Guide to the.
[9] Holm, D. S., Mikkelsen, R. Ø., Sørensen, M., & Stidsen, T. J. (2022). A graph-based MIP formulation of the International Timetabling Competition 2019. Journal of Scheduling, 25(4), 405-428.
[10] Hertz, A. (1991). Tabu search for large scale timetabling problems. European journal of operational research, 54(1), 39-47.
[11] Alvarez-Valdes, R., Crespo, E., & Tamarit, J. M. (2002). Design and implementation of a course scheduling system using tabu search. European Journal of Operational Research, 137(3), 512-523.
[12] Minh, K. N. T. T., Thanh, N. D. T., Trang, K. T., & Hue, N. T. T. (2010). Using tabu search for solving a high school timetabling problem.
[13] Weare, R., Burke, E., & Elliman, D. (1995). A hybrid genetic algorithm for highly constrained timetabling problems. Department of Computer Science.
[14] Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European journal of operational research, 140(2), 266-280.
[15] Актиуелна документација OptaPlanner библиотеке,
https://www.optaplanner.org/docs/optaplanner/latest/optimization-algorithms/optimization-algorithms.html#whichOptimizationAlgorithmsShouldIUse [датум приступа август 2023]
[16] Правилник о изради распореда наставе, ФТН,
http://www.ftn.uns.ac.rs/520569743/pravilnik-o-izradi-rasporeda-casova-nastave-i-rasporeda-ispita-na-fakultetu-tehnickih-nauka-od-31-01-2019- [датум приступа август 2023]
[17] SpringBoot радни оквир,
https://spring.io/projects/spring-boot
[датум приступа август 2023]
[18] OptaPlanner библиотека,
https://www.optaplanner.org/docs/optaplanner/latest
[датум приступа август 2023]
[19] First fit decreasing алгоритам,
https://www.optaplanner.org/docs/optaplanner/latest/construction-heuristics/construction-heuristics.html#firstFitDecreasing
[датум приступа август 2023]
[20] Late acceptance алгоритам,
https://www.optaplanner.org/docs/optaplanner/latest/local-search/local-search.html#lateAcceptance
[датум приступа август 2023]
[2] Jacob, R. J. K., & Froscher, J. N. (1990). A software engineering methodology for rule-based systems. IEEE Transactions on Knowledge and Data Engineering, 2(2), 173-189.
[3] Jackson, P. (1986). Introduction to expert systems.
[4] Tакмичење у оптимизацији распореда наставе за 2019. годину, https://www.itc2019.org/home [датум приступа август 2023]
[5] Wren, A. (1995, August). Scheduling, timetabling and rostering—a special relationship?. In International conference on the practice and theory of automated timetabling (pp. 46-75). Berlin, Heidelberg: Springer Berlin Heidelberg.
[6] Kristiansen, S., & Stidsen, T. R. (2013). A comprehensive study of educational timetabling—A survey. Department of Management Engineering, Technical University of Denmark. DTU Management Engineering Report, 8.
[7] Al-Betar, M. A., Khader, A. T., & Liao, I. Y. (2010). A harmony search with multi-pitch adjusting rate for the university course timetabling. Recent advances in Harmony search algorithm, 147-161.
[8] Garey, M. R., & Johnson, D. S. (1979). Computers and intractability. A Guide to the.
[9] Holm, D. S., Mikkelsen, R. Ø., Sørensen, M., & Stidsen, T. J. (2022). A graph-based MIP formulation of the International Timetabling Competition 2019. Journal of Scheduling, 25(4), 405-428.
[10] Hertz, A. (1991). Tabu search for large scale timetabling problems. European journal of operational research, 54(1), 39-47.
[11] Alvarez-Valdes, R., Crespo, E., & Tamarit, J. M. (2002). Design and implementation of a course scheduling system using tabu search. European Journal of Operational Research, 137(3), 512-523.
[12] Minh, K. N. T. T., Thanh, N. D. T., Trang, K. T., & Hue, N. T. T. (2010). Using tabu search for solving a high school timetabling problem.
[13] Weare, R., Burke, E., & Elliman, D. (1995). A hybrid genetic algorithm for highly constrained timetabling problems. Department of Computer Science.
[14] Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European journal of operational research, 140(2), 266-280.
[15] Актиуелна документација OptaPlanner библиотеке,
https://www.optaplanner.org/docs/optaplanner/latest/optimization-algorithms/optimization-algorithms.html#whichOptimizationAlgorithmsShouldIUse [датум приступа август 2023]
[16] Правилник о изради распореда наставе, ФТН,
http://www.ftn.uns.ac.rs/520569743/pravilnik-o-izradi-rasporeda-casova-nastave-i-rasporeda-ispita-na-fakultetu-tehnickih-nauka-od-31-01-2019- [датум приступа август 2023]
[17] SpringBoot радни оквир,
https://spring.io/projects/spring-boot
[датум приступа август 2023]
[18] OptaPlanner библиотека,
https://www.optaplanner.org/docs/optaplanner/latest
[датум приступа август 2023]
[19] First fit decreasing алгоритам,
https://www.optaplanner.org/docs/optaplanner/latest/construction-heuristics/construction-heuristics.html#firstFitDecreasing
[датум приступа август 2023]
[20] Late acceptance алгоритам,
https://www.optaplanner.org/docs/optaplanner/latest/local-search/local-search.html#lateAcceptance
[датум приступа август 2023]
Objavljeno
2023-12-04
Sekcija
Elektrotehničko i računarsko inženjerstvo
