基于分类优化和优先级算法的自动排课探讨

The Discuss on Automatic Course Arrangement Based on Classification Optimization and Priority Algorithm

为解决目前高校自动排课系统设计复杂、排课效率低的问题，提出了一种基于分类优化、优先级算法以及矩阵匹配运算的自动排课算法。该算法首先对课程进行分类优化，然后按优先级进行计算，其次引入矩阵的迭加匹配运算，将整个问题分层分类处理，从而使大问题分散在各个子问题当中，并通过逐层处理达到了降低算法复杂性、减少死锁的目的，最终实现自动排课。

To solve the problems of the complexity and low effectiveness of course schedule in automatic course arrangement system in universities, a new algorithm for automatic course arrangement is proposed based on the theory of classification optimization, priority algo- rithm and matrix computation. The main ideas of the proposed method are as follows. The courses to be scheduled are firstly optimally classified and then leveled and sorted based on the priority and matching matrices. Thus, a large problem is shifted into some small problems that can be solved easily. Thus, automatic course arrangement is implemented with lower complexity and reduced deadlock.