论文部分内容阅读
一、引言时间表(Timetabling)问题是一类优化组合受限多元资源的调度问题,其拥有非常广泛的应用领域,像医院病房调度、航班时刻表、列城市公路运营、车时刻表等等。到目前已经证明该类问题是一种NP完全问题,而NP完全问题不存在时间复杂度为多项式时间的算法。本文中的编排学校课程表是解决时间表问题的一个应用.
I. INTRODUCTION Timetabling problem is a kind of scheduling problem that optimizes the combination of limited and diversified resources. It has a very wide range of applications, such as hospital ward scheduling, flight schedules, column city road operation, car schedules and so on. So far it has been proved that this kind of problem is an NP-complete problem, whereas the NP-complete problem does not have an algorithm whose time complexity is polynomial-time. The choreographed school curriculum in this article is an application that addresses the timeline problem.