一种基于案例和约束的排课系统  

Course Scheduling Based on Cases and Constraints

作　　者：王学军[1] 

机构地区：[1]广东工业大学华立学院,广东广州511325

出　　处：《计算机与现代化》2008年第6期129-132,共4页Computer and Modernization

摘　　要：排课问题其本质就是时间表问题,属于典型的组合优化和不确定性调度问题,已经被证明为NP-Complete类问题。针对已有排课案例中大量知识和排课过程大量存在的教师和学生的特殊需求,提出了面向规则的形式化描述:TPQE描述体系,对排课问题中的强规则和弱规则进行了描述和形式化表示,同时提出了规则约束力的表示方法,设计了用于求解最大化WTPQE权值的算法——Weighted SAT,开发相应的原型系统。Course Scheduling is a classic time-table problem in nature and a typed combinatorial optimization and uncertain schedu.ling problem which had been verified a NP-Complete problem. In the existed cases of Course Scheduling Scheme, there are numerous knowledge about the Course Scheduling. Also, there exist lots of the special requirements of teachers and students. This thesis researches the Case-based Course Scheduling, main points including： the formalization of Course Scheduling, the description frame employing Temporal and Place Qualified Expression （TPQE） ; The formalization of strong rides and soft rides, and the defining and expression method of the constraint power of rides; Designing a new arithmetic Weighted SAT based on the SAT- resolved arithmetic; Developing the prototype system to demonstrate the process.

关 键 词：排课问题 约束 时间地点限定表达式 命题可满足性 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]