一种逻辑决策的排课算法

摘要

Scheduling problem is a typical combinatorial optimization and uncertain scheduling problems.Teaching with its own characteristics,introduces a logical decision-making algorithms to solve practical problems.To teachers,classrooms,class,time and other resources through the string to represent 0 and 1,with these strings and or operations,eventually either get a reasonable curriculum,but also quick and easy process to resolve resource conflicts Scheduling.Through simulation results show that the algorithm can meet the problem of multiple university Timetable constraints,to more effectively address the university course scheduling problem.%排课问题是一个典型的组合优化和不确定调度问题。结合高校教学自身的特点,引入了一种逻辑决策的算法来解决实际问题。把教师、教室、班级、时间等资源通过0和1字符串来表示,对这些字符串进行与和或运算,最终既可以获得合理的课表,又可以方便快捷解决排课过程中资源冲突问题。经过仿真实验证明该算法能够满足高校排课问题的多重约束条件,能更有效地解决高校排课问题。