【作者】 费华平；

【导师】 司志刚；

【作者基本信息】 解放军信息工程大学 ， 计算机应用技术， 2007， 硕士

【摘要】 排课问题在分类上,可以归为资源分配问题,资源分配就是必须以满足所有限制为前提的情况下,将有限的资源分配给每一个活动。满足资源限制与排课规则等硬性限制的课表,只能算是可行的课表;若要提高课表的满意度则必须要考虑更多的软性限制,也就是每个教员的授课偏好。但在实际上不可能完全满足每一个教员的需求,比较可行的解决方案是让课表可以满足所有的硬性限制,并且尽可能满足软性限制。本研究在解决方案中出除了考虑硬性限制以确保课表的可行性外,还考虑排课问中的软性限制。本研究针对排课过程当中安排资源的原则,以及课程、教员、教室与教学班之间相互的限制关系建立一套排课问题的Constraints Satisfaction Problems(CSP)模型。然后利用ILOG Scheduler与ILOG Solver工具在C++Builder 5.0环境下设计一个有效的运算解决方法。更多还原

【Abstract】 In the classification the arrangement of the curriculum can be defined as the distribution of the resource that is distributing the limited resource to every action under the premise of satisfying all of the constraint.Satisfying resource constraint and the rule of the arrangement of the curriculum is just a feasible schedule. If want to improve the satisfaction of the schedule, soft constraint must be thought of which is the hobby of every teacher.But in fact, satisfying every teacher’s hobby completely is impossible, the more feasible solution is to make the schedule to satisfy the hard constraint and satisfy the soft constraint as far as possible.The paper proposes a solution that not only thinks of the hard constraint to assure the feasibility of the schedule, but also thinks of the soft constraint in the schedule. According to the principle of the arrangement of the resource of the schedule and the constraint relation between curriculum, teacher, classroom and class, establishes a model of the arrangement of the curriculum called CSP(Constraints Satisfaction Problems).And then designed a effective solution under the environment of C++ Builder 5. 0 with the tool of ILOG Scheduler and ILOG Solver.更多还原