Timetable problem with large scale and numerous constraints is a NP-hard problem which many researchers in the operational research and computer fields have been dedicated to resolve but have not found a best solution.

• 摘要排课问题实际上是时间表优化的问题，由于其超大的求解规模和众多的约束条件，是运筹学领域和计算机领域一直致力寻求解决但没有得到解决的np难解问题。