外文文献,排课系统.docVIP

外文文献： Arrangement system University teachers arrangement system is a combination of problems, which consist of scheduling a set of courses within a given number of rooms and time periods. Solving a real world timetabling problem manually often requires a significant amount of time, sometimes several days or even weeks. Therefore, a lot of research has been invested in order to provide automated support for human timetablers. Contributions come from the fields of operations research and artificial Intelligence. This paper refers to terms and methods from constraint satisfaction. The methods presented were developed using constraint logic programming. Constraint logic programming combines the declarativity of logic programming with the efficiency of methods from operations research and artificial intelligence. It has recently become a promising approach for solving timetabling problems. Applying classical methods from constraint satisfaction requires to model the problem as a constraint satisfaction problem, a set of variables, each associated with a domain of values it can take on, and a set of constraints among the variables. Constraints are relations that specify the space of solutions by forbidding combinations of values. Methods include search, heuristics, and constraint propagation. Typically, systematic search assigns values to variables sequentially following some search order. If the procedure fails to extend a partial solution, decisions are undone and alternatives explored. Systematic search often relies on heuristics, which define the order in which variables and values are chosen. Constraint propagation is complementary; it simplifies a problem by identifying values that cannot participate in a solution. This way the search space gets pruned and search becomes easier. In practice, most constraint-based timetabling systems either do not support soft constraints or use a branch and bound search instead of chronological backtracking. Branch and bound start