We can divide the timetable problem into two layers to solve. At first we should select a suitable time slice, and then according to the time slice we proceed to schedule the classrooms.
可把排课表问题分成两个层次进行，首先选择合适时间，然后再根据这个时间进行教室调度。
In order to deal with the timetable problem, the NP-hard problem, this paper designs a new method by the use of R_timetable, which is based on the character of college courses arrangement.
为了处理课程表问题这个NP完全类问题，根据大学编排课表的特点设计了一种全新的使用r _时刻表的设计方法。
Timetable problem is a typical problem of combined optimization in the fields of operational research and systems engineering, which belongs to NP problem.
时间表问题是运筹学领域和系统工程领域中的典型组合优化问题，是由于事件对时间和空间的资源争夺而产生的，属于NP完全类问题。
应用推荐