.png){kind=icon}
Return
Using genetic algorithm methods to solve course scheduling problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0957-4174(03)00004-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2003 Elsevier Science Ltd. All rights reserved.
Keywords:
genetic algorithm
course scheduling
optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSave
ShareSave no more
no more