Thisvolumecontainsaselectionofpapersfromthe4thInternationalConference on the Practice and Theory of Automated Timetabling (PATAT 2002) held in Gent, August 21–23, 2002. Since the ?rst conference in Edinburgh in 1995, the range of timetabling applications at the conferences has become broader and more diverse. In the s- ected papers volume from the 1995 conference, there were just two contributions (out of 22) which did not speci?cally address school and university timetabling. In the selected papers volume from the 1997 conference in Toronto, the number of papers which tackled non-educational problems increased. Two of the papers addressed more than one timetabling application. In both of these papers, educational applications were considered in addition to other applications. A further three papers were concerned with non-educational applications. The conference steering and programme committees have worked hard to attract a wide range of timetabling applications. In the conference held in Konstanz in 2000, the diversi?cation of timetabling problems increased signi?cantly. Of the 21 selected papers in the postconference volume, just 13 were speci?cally concerned with educational timetabling. In the previous volumes, the papers had been sectioned according to solution technique. In the Konstanz volume the papers were classi?ed according to application domains. One section of the volume was entitled “Employee Timetabling,” while sports timetabling, air?eet scheduling, and general software architectures for timetabling were also represented. In the present volume, more than one-third of the 21 papers discuss problems in application areas other than academic and educational ones. Sports timetabling and hospital timetabling are particularly well represented.
Author(s): Dominique de Werra (auth.), Edmund Burke, Patrick De Causmaecker (eds.)
Series: Lecture Notes in Computer Science 2740
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2003
Language: English
Pages: 368
Tags: Algorithm Analysis and Problem Complexity; Numeric Computing; Discrete Mathematics in Computer Science; Artificial Intelligence (incl. Robotics); Computer Appl. in Administrative Data Processing; Operations Research/Decision Theory
Front Matter....Pages -
Front Matter....Pages 1-1
Constraints of Availability in Timetabling and Scheduling....Pages 3-23
A Standard Framework for Timetabling Problems....Pages 24-38
Solving Dynamic Resource Constraint Project Scheduling Problems Using New Constraint Programming Tools....Pages 39-59
Front Matter....Pages 61-61
Integer and Constraint Programming Approaches for Round-Robin Tournament Scheduling....Pages 63-77
Characterizing Feasible Pattern Sets with a Minimum Number of Breaks....Pages 78-99
Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach....Pages 100-109
Front Matter....Pages 111-111
Personnel Scheduling in Laboratories....Pages 113-119
Scheduling Doctors for Clinical Training Unit Rounds Using Tabu Optimization....Pages 120-128
Relaxation of Coverage Constraints in Hospital Personnel Rostering....Pages 129-147
Storing and Adapting Repair Experiences in Employee Rostering....Pages 148-165
Scheduling Agents – Distributed Timetabling Problems....Pages 166-177
Front Matter....Pages 179-179
A Multiobjective Optimisation Technique for Exam Timetabling Based on Trajectories....Pages 181-194
Enhancing Timetable Solutions with Local Search Methods....Pages 195-206
A Hybrid Algorithm for the Examination Timetabling Problem....Pages 207-231
GRASPing the Examination Scheduling Problem....Pages 232-244
Front Matter....Pages 245-245
Search Strategy for Constraint-Based Class–Teacher Timetabling....Pages 247-261
Multi-neighbourhood Local Search with Application to Course Timetabling....Pages 262-275
Knowledge Discovery in a Hyper-heuristic for Course Timetabling Using Case-Based Reasoning....Pages 276-287
Generalizing Bipartite Edge Colouring to Solve Real Instances of the Timetabling Problem....Pages 288-298
Flow Formulations for the Student Scheduling Problem....Pages 299-309
Front Matter....Pages 245-245
University Course Timetabling with Soft Constraints....Pages 310-328
A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem....Pages 329-351
Back Matter....Pages -
