Practice and Theory of Automated Timetabling II -

Practice and Theory of Automated Timetabling II

Second International Conference, PATAT'97, Toronto, Canada, August 20 - 22, 1997, Selected Papers

Edmund Burke, Michael Carter (Herausgeber)

Buch | Softcover
XII, 280 Seiten
1998 | 1998
Springer Berlin (Verlag)
978-3-540-64979-3 (ISBN)
53,49 inkl. MwSt
This book constitutes the thoroughly refereed post-workshop proceedings of the Second International Conference on the Practice and Theory of Automated Timetabling, PATAT'97, held in Toronto, Canada, in August 1997.
The 17 revised full papers presented were carefully selected for presentation at the conference and then had to pass a second round of reviewing. The book is divided into topical sections on surveys, tabu search and simulated annealing, evolutionary computation (population-based methods), constraint-based methods, graph theory, and practical issues.

Recent developments in practical course timetabling.- Space allocation: An analysis of higher education requirements.- Off-the-peg or made-to-measure? timetabling and scheduling with SA and TS.- Generalized assignment-type problems a powerful modeling scheme.- An examination scheduling model to maximize students' study time.- A comparison of annealing techniques for academic course scheduling.- Some observations about GA-based exam timetabling.- Experiments on networks of employee timetabling problems.- Evolutionary optimisation of methodist preaching timetables.- Improving a lecture timetabling system for university-wide use.- A constraint-based approach for examination timetabling using local repair techniques.- Generating complete university timetables by combining tabu search with constraint logic.- Construction of basic match schedules for sports competitions by using graph theory.- A standard data format for timetabling instances.- Academic scheduling.- The implementation of a central timetabling system in a large British civic University.- A brute force and heuristics approach to tertiary timetabling.

Erscheint lt. Verlag 26.8.1998
Reihe/Serie Lecture Notes in Computer Science
Zusatzinfo XII, 280 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 379 g
Themenwelt Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Schlagworte Algorithm analysis and problem complexity • Evolution • evolutionary computation • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Heuristics • Logic • Modeling • Optimization • proving • Wirtschaftsinformatik
ISBN-10 3-540-64979-4 / 3540649794
ISBN-13 978-3-540-64979-3 / 9783540649793
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
29,99
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
32,99