Download pdf
The application of greedy algorithm in the course selection and scheduling system of college students
- 1 Beijing Information Science and Technology University
* Author to whom correspondence should be addressed.
Abstract
On December 19, 2023, the Chinese Ministry of Education's press conference once again emphasized the continued expansion of undergraduate professional degree enrollment. Nowadays, under the influence of the expanding enrollment scale of colleges and universities, the reasonable allocation of limited educational resources has become the primary task of educators, and college students' course choice and course arrangement will directly determine their school life quality. However, the number of students is large, so the research topic of this paper is to use greedy algorithms to design a more efficient course selection and scheduling system. The course selection and scheduling system based on the greedy algorithm can save the resources required by manual scheduling to the maximum extent and directly improve the work efficiency of educators. The system designed and practiced in this paper is effective to a certain extent, and the effective use of the algorithm can avoid many problems in course selection and course arrangement.
Keywords
Automatic course scheduling, course selection, greedy algorithms, conflict
[1]. Sun, D. Y. (2012). Course scheduling problem and algorithm analysis in colleges and universities. Information and Computer, 10, 210-211.
[2]. Zhong, Y. G. and Liu, Q. F. (2012). Mathematical model of university course scheduling based on genetic algorithm. Journal of Dongguan University of Technology, 10(19), 4-8.
[3]. Chen, X. P., Chen, J. and Chen, Q. H. (2004). Design of university course scheduling system based on Genetic algorithm. Journal of Shaoxing University of Arts and Sciences, 34(20), 25-28 (in Chinese).
[4]. He, X. H. (2012). Application of an improved ant colony algorithm in course scheduling. Electronic Design Engineering, 8(20), 28-29.
[5]. Zhao, Y. F. (2013). Design of multimedia classroom scheduling algorithm based on greedy algorithm. Information Technology, 13, 800-82.
[6]. Chen, Z. F. (2008). Research and implementation of university educational administration management system. Soochow University, 4, 42-44.
[7]. Xiang, Y. F. (2007). Design and implementation of educational administration management system in higher vocational colleges. South China University of Technology, 11, 35-37.
[8]. Nie, X. D. (2006). Research and implementation of course scheduling system based on greedy algorithm. Guangdong University of Technology, 2006
[9]. Wu, X. and Jiang, Y. M. (2010). Course scheduling problem using immune particle swarm optimization. Computer Engineering and Design, 31(17), 3872-3875.
Cite this article
Xiao,J. (2024). The application of greedy algorithm in the course selection and scheduling system of college students. Applied and Computational Engineering,75,48-53.
Data availability
The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.
Disclaimer/Publisher's Note
The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
About volume
Volume title: Proceedings of the 2nd International Conference on Software Engineering and Machine Learning
© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and
conditions of the Creative Commons Attribution (CC BY) license. Authors who
publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons
Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this
series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published
version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial
publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and
during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See
Open access policy for details).