首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A Survey of Automated Timetabling
Authors:A Schaerf
Institution:(1) Dipartimento di Ingegneria Elettria Gestionale e Meccanica, Universitá di Udine, Via delle Scienze 208, 33100 Udine, Italy
Abstract:The timetabling problem consists in scheduling a sequence of lectures between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. A large number of variants of the timetabling problem have been proposed in the literature, which differ from each other based on the type of institution involved (university or school) and the type of constraints. This problem, that has been traditionally considered in the operational research field, has recently been tackled with techniques belonging also to Artificial Intelligence (e.g., genetic algorithms, tabu search, and constraint satisfaction). In this paper, we survey the various formulations of the problem, and the techniques and algorithms used for its solution.
Keywords:timetabling  combinatorial optimization  scheduling  local search  heuristics
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号