University Timetabling Problem(TP) is analyzed. An optimization mathematical model of university TP is established, and the framework structure to solve university TP is founded.
简析高校排课问题，建立相应的数学优化模型，构建基本求解框架。
参考来源 - 基于最佳个体置换策略的高校排课问题求解Course Scheduling is a typical portfolio optimization and uncertainty of scheduling problems, but also a complete problem.
排课问题是一个典型的组合优化和不确定性调度问题，也是一个完全问题。
参考来源 - 基于遗传算法的高校智能排课系统—《电脑知识与技术·学术交流》—2008年第28期—龙源期刊网Since course arrangement problem is restrictingmulti-objective and difficult in combinational optimization, using intellectual andparallel inherit calculation, in order to resolve course arrangement problem, is thewise option for achieving such problem solution.
排课问题是一个有约束的、多目标的、难解的组合优化问题，采用具有智能性和并行性的遗传算法，来对排课问题进行求解，是所有求解该问题方法中较明智的选择。
参考来源 - 基于遗传算法的高校排课系统设计与分析As the classic NP-Complete Problem, University Timetable Problem is very important to the academic course scheduling management system.
作为典型的NP完全问题,大学排课问题在教务管理系统中非常重要。
参考来源 - 用量子遗传算法求解大学排课问题—《电脑知识与技术》—2010年第5期—龙源期刊网·2,447,543篇论文数据，部分数据来源于NoteExpress
因此，众多专家学者尝试利用计算机来解决排课问题。
Therefore, many experts and scholars try resolving Timetabling Problem using computer.
高校排课问题的研究目的是高效率地获取合理的排课方案。
The purpose of the study on university courses arrangement is to obtain a reasonable time table efficiently.
有人把排课问题化成整数规划来解决，但计算量很大，至今没有一个切实可行的算法。
Some people regard the arranging schedule as the question of integral programming, but the calculative scale is very great, there is no a suitable arithmetic to solve it.
应用推荐