Practice and Theory of Automated Timetabling IV
Practice and Theory of Automated Timetabling IV
复制标题
自动时间表的实践与理论 IV
DOI：
10.1007/b11828
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
P. D. Causmaecker
中科院分区：
文献类型：
--
作者：
E. Burke;P. D. Causmaecker
在过去的十年里，时间表问题得到了广泛的研究。由于此类问题的复杂性和多样性，大多数工作涉及静态问题，其中要安排的活动和资源是预先已知的，并且约束是固定的。然而，每个时间表问题都会受到意外事件的影响（例如，大学时间表问题、老师失踪或幻灯片放映机故障）。在这种情况下，人们必须快速构建一种新的解决方案，将这些事件考虑在内，并且最好与当前的解决方案没有太大不同。我们在本文中介绍了基于约束规划的工具，用于解决建模为资源受限项目调度问题的动态时间表问题。这种方法使用基于解释的约束规划和运筹学技术。
Timetabling problems have been much studied over the last decade. Due to the complexity and the variety of such problems, most work concerns static problems in which activities to schedule and resources are known in advance, and constraints are fixed. However, every timetabling problem is subject to unexpected events (for example, for university timetabling problems, a missing teacher, or a slide projector breakdown). In such a situation, one has to quickly build a new solution which takes these events into account and which is preferably not too different from the current one. We introduce in this paper constraint-programming-based tools for solving dynamic timetabling problems modelled as Resource-Constrained Project Scheduling Problems. This approach uses explanation-based constraint programming and operational research techniques.