Therefore, many experts and scholars try resolving Timetabling Problem using computer.
因此，众多专家学者尝试利用计算机来解决排课问题。
As a Timetabling problem, Course Dispatching is a very important part of the college affairs management.
作为一个时间表问题，排课是高校教学管理中的很重要的一个部分。
Timetabling Problem (TP) is a Multiobjective Combination Optimization Problem with constraints, and also has been proved NP-Completed.
排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明为一个NP完全问题。
Therefore, on the basis of the successful experience and the practical situation of my college, this thesis mainly discusses how to solve the timetabling problem using GA.
因此，借鉴以往成功经验并结合本单位实际情况，本文尝试将遗传算法引入到排课问题的求解。
When it was applied to timetabling problem, Experimental results showed that combinatorial optimization problem can be better resolved, though there was no better solution to this problem at present.
把该方法应用到排课问题中，实验结果表明对目前仍没有较好解决方法的组合优化问题，可以得到比较容易的解决。
Timetabling is also called the scheduling problem.
排课表问题又称时间表问题。
Timetabling is also called the scheduling problem.
排课表问题又称时间表问题。
应用推荐