查询词典 timetabling

University course timetabling problems are combinatorial problems, which consist of scheduling a set of courses within a given number of rooms and time periods.

大学的排课系统是一个组合的问题，这个问题是由在规定的房间和时间段的数量内安排一套课程组成。

With the constantly development of high education, timetabling has played an important role in training students and rising the education quality.

作为高校，如何才能提高办学效率，更好地完成教学任务，跟上社会发展步伐，这是一个摆在教学工作者面前的一个迫切的问题。

After nearly 40 years of development, the genetic algorithm in the theoretical study and practical application was a great success, this paper genetic algorithm for solving the course timetabling problem, first discussed the impact of factors in the course arrangement, the main constraints, to solve goals and difficulties, and a complete mathematical model to describe the course arrangement.

经过近40年的发展，遗传算法在理论研究和实际应用中取得了巨大的成功，本文将遗传算法用于排课问题的求解，首先讨论了排课问题中的影响因素、主要约束条件、求解目标和难点，并用数学模型完整地描述了排课问题。

So resolving this kind of problem efficiently has great research value in theory, and especially resolving those problems, such as resource allocation, job shop scheduling, timetabling, and routing, still has very important realism significance and commerce significance.

因而对该类问题的高效求解具有重大的理论研究价值，特别是像资源分配、生产调度、时间表和路由等问题的求解还具有及其重要的现实意义和商业意义。

As achieving a perfect curriculum schedule in a short time by manual work is not only takes great deal of time, but also is absolutely impossible to make full use of current resources, it is vital significance to develop a set of actually automatic timetabling system.

通过手工排课，不仅费时，费力，而在较短时间内用人工编制一份令人满意且使学校现有资源得到充分利用的课表也不是一件容易的事。因而开发一套符合实际需求的高校课程信息管理系统是非常必要的。

As achieving a perfect Curriculum Schedule in a short time by manual work is not only takes great deal of time, but also is absolutely impossible to make full use of current resources, it is vital significance to develop a set of actually automatic Timetabling system.

通过手工排课，不仅费时，费力，而在较短时间内用人工编制一份令人满意且使学校现有资源得到充分利用的课表也不是一件容易的事。因而开发一套符合实际需求的高校排课系统是非常必要的。

The timetabling problem is an NP-hard multiobjective combinatorial optimization problem with constraints.

排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明为一个NP难问题。

A large number of algorithms have been proposed in the literature, which differ from each other based on the type of institution involved and the type of constraints. This paper first surveys the origin and the techniques, then presents the AI Planning-based algorithm to solve TTP. We implement the algorithm by SQL language, which is Timetabling Problem, and show that it is of great value by using the simulated data on it. At the end of this paper we describe other applied domains and its prospect.

时间表问题是一类应用非常广泛的研究课题，目前业出现了各种各样的解决时间表问题的方法，本文简要分析了近几十年时间表问题研究的历史和技术现状，提出了基于智能规划方法的时间表问题解决方案Plan TTP，并且我们用SQL语言实现了这一解决方案Plan TTP，通过对学校课程表的模拟实验证明该方法具有较大的使用价值，最后指出Plan TTPS的一些其他应用领域和发展前景等。

So resolving this kind of problem efficiently has great research value in theory, and especially resolving those problems, such as resource allocation, job shop scheduling, timetabling, and routing, still has very important realism significance and commerce significance.

本文主要研究内容为基于约束的现代调度，即运用约束程序设计方法来求解现代调度问题，从而拓展了约束程序设计在求解组合优化问题方面的应用领域。

ehta algorithm of artificial intelligence is the heuristic search theory analysis and improvement, and design of a suitable timetabling algorithm, it contains a side strategy, choosing bad strategy, tactics, learning strategy prospects detection, etc. ehta algorithm used in universities in system, reduce artificial intervention, reasonable arrangement of course, teachers and balanced class teacher of load on the good effect, can greatly improve the efficiency of course.

ehta算法是对人工智能中的启发式搜索理论加以分析和改进，设计的一种适用于高校排课的算法，它包含了靠边策略、择劣策略、前景探测策略、学习策略等内容。ehta算法应用在高校排课系统中，在减少人工干预排课次数、科学安排教师、均衡班级和教师的日负荷等方面起到了良好的效果，大大提高了排课效率。

The absorption and distribution of chromium were studied in ryeusing nutrient culture technique and pot experiment.

采用不同浓度K2CrO4(0，0.4，0.8和1.2 mmol/L)的Hoagland营养液处理黑麦幼苗，测定铬在黑麦体内的亚细胞分布、铬化学形态及不同部位的积累。

By analyzing theory foundation of mathematical morphology in the digital image processing, researching morphology arithmetic of the binary Image, discussing two basic forms for the least structure element: dilation and erosion.

通过分析数学形态学在图像中的理论基础，研究二值图像的形态分析算法，探讨最小结构元素的两种基本形态：膨胀和腐蚀；分析了数学形态学复杂算法的基本原理，把数学形态学的部分并行处理理念引入到家实际应用中。