Using genetic algorithm methods to solve course scheduling problems

作者:

Highlights:

摘要

Course scheduling at colleges is an optimization problem to be solved under multiple constraints. The most important tasks of course scheduling should consider various constraints, such as conflict in teaching hours, meeting teacher preferences, and the continuity of teaching hours, etc. This study utilized genetic algorithm methods to deal with the multiple constraints issue. The results of this study indicated a significant reduction in the amount of time required for course scheduling; and the results are more acceptable by teachers.

论文关键词:Genetic algorithm,Course scheduling,Optimization

论文评审过程:Available online 20 February 2003.

论文官网地址:https://doi.org/10.1016/S0957-4174(03)00004-6