This book contains a selection of strictly refereed papers presented at the First International Conference on the Practice and Theory of Automated Timetabling, held in Edinburgh, UK, August/September 1995.
This is the first book entirely devoted to automated timetabling and meets the clear need for a wide-ranging survey of the state of the art in the area. The book contains four survey papers by leading experts together with 19 revised full papers presenting new results; the papers are organized in topical sections on reasoning about constraints, genetic algorithms, complexity issues, and tabu search and simulated annealing.
Author(s): Michael W. Carter, Gilbert Laporte (auth.), Edmund Burke, Peter Ross (eds.)
Series: Lecture Notes in Computer Science 1153
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1996
Language: English
Pages: 389
Tags: Algorithm Analysis and Problem Complexity; Artificial Intelligence (incl. Robotics); Information Systems Applications (incl.Internet); Business Information Systems; Computers and Education
Recent developments in practical examination timetabling....Pages 1-21
Computer-aided school and university timetabling: The new wave....Pages 22-45
Scheduling, timetabling and rostering — A special relationship?....Pages 46-75
Examination timetabling in British Universities: A survey....Pages 76-90
Employee timetabling, constraint networks and knowledge-based rules: A mixed approach....Pages 91-105
Automated time table generation using multiple context reasonig with truth maintenance....Pages 106-111
Investigations of a constraint logic programming approach to university timetabling....Pages 112-129
Building University timetables using constraint logic programming....Pages 130-145
Complete University modular timetabling using constraint logic programming....Pages 146-161
Using Oz for college timetabling....Pages 162-177
A smart genetic algorithm for university timetabling....Pages 179-197
A genetic algorithm solving a weekly course-timetabling problem....Pages 198-211
GA-based examination scheduling experience at Middle East Technical University....Pages 212-226
Peckish initialisation strategies for evolutionary timetabling....Pages 227-240
A memetic algorithm for university exam timetabling....Pages 241-250
Extensions to a memetic timetabling system....Pages 251-265
Automatic timetabling in practice....Pages 266-279
The complexity of timetable construction problems....Pages 281-295
Some combinatorial models for course scheduling....Pages 296-308
The phase-transition niche for evolutionary algorithms in timetabling....Pages 309-324
Three methods used to solve an examination timetable problem....Pages 325-344
General cooling schedules for a simulated annealing based timetabling system....Pages 345-363
How to decompose constrained course scheduling problems into easier assignment type subproblems....Pages 364-373
Other timetabling papers....Pages 375-379
