Arranging course automatically algorithm based on multi-factor priority
Wei Zhi, Huaping Feng
Available Online November 2012.
- https://doi.org/10.2991/citcs.2012.155How to use a DOI?
- arranging course automatically algorithm; time division; the compute of the priority; quick sort; provisional matrix
- The problems of course timetabling mainly involve time, curriculum, the number of classrooms and so on. A new algorithm based on multi-factor priority is proposed in this paper. The algorithm use time division, the compute of the priority, the provisional matrix and quick sort to achieve the function of arranging course automatically. Finally, the paper gives some examples to prove the feasibility of the algorithm
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Wei Zhi AU - Huaping Feng PY - 2012/11 DA - 2012/11 TI - Arranging course automatically algorithm based on multi-factor priority BT - 2012 National Conference on Information Technology and Computer Science PB - Atlantis Press SP - 605 EP - 608 SN - 1951-6851 UR - https://doi.org/10.2991/citcs.2012.155 DO - https://doi.org/10.2991/citcs.2012.155 ID - Zhi2012/11 ER -