基于贪婪算法的排课系统  

The Course Scheduling System based on Greedy Algorithm

作　　者：许郡[1] 

机构地区：[1]扬州职业大学,江苏扬州225009

出　　处：《扬州教育学院学报》2009年第3期32-35,共4页Journal of Yangzhou College of Education

摘　　要：提出一种基于贪婪算法、利用三维数组的简单排课模型,即将教师、教室、班级看作三个独立的排课元素,教师、教室、班级各有一个三维数组与之相对应。将班级作为排课的第一参照,也就是主约束条件,即首要考虑班级排课需求,当且仅当教师、教室、班级三者的约束条件都满足时,排课成功。系统采用了一系列解决方法,使得排出的课表高效并且实用。The course scheduling system is a very important part of the OAS. With the increasing number of students, current course scheduling system cannot meet the need of our teaching management. A new course scheduling system based on greedy algorithm and three-dimensional array are put forward. Teacher, classroom and class are three separated curriculum cells. For each curriculum cell, there is a three-dimension array. Among them, class is the first reference, that is, major constraint. If and only if the three cells are well organized, the course scheduling system is completed. This system adopts a series of solutions, which will certainly make class schedules more practical and efficient.

关 键 词：贪婪算法 排课系统 

分 类 号：G473.4[文化科学—教育学]