default search action
Annals of Operations Research, Volume 194
Volume 194, Number 1, April 2012
- Edmund K. Burke
, Michel Gendreau:
Preface. 1 - Mohammed Azmi Al-Betar
A harmony search algorithm for university course timetabling. 3-31 - Burak Bilgin, Patrick De Causmaecker
Local search neighbourhoods for dealing with a novel nurse rostering model. 33-57 - Alex Bonutti, Fabio De Cesco, Luca Di Gaspero
Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results. 59-70 - Edmund K. Burke
A branch-and-cut procedure for the Udine Course Timetabling problem. 71-87 - Edmund K. Burke
Linear combinations of heuristics for examination timetabling. 89-109 - Hadrien Cambazard, Emmanuel Hebrard
Local search and constraint programming for the post enrolment-based course timetabling problem. 111-135 - Fabrício N. Costa, Sebastián Urrutia
An ILS heuristic for the traveling tournament problem with predefined venues. 137-150 - Teodor Gabriel Crainic
Designing the master schedule for demand-adaptive transit systems. 151-166 - Patrick De Causmaecker
Towards a reference model for timetabling and rostering. 167-176 - Ulrich Dorndorf, Florian Jaehn, Erwin Pesch:
Flight gate scheduling with respect to a reference schedule. 177-187 - Martin Josef Geiger
Applying the threshold accepting metaheuristic to curriculum based course timetabling - A contribution to the second international timetabling competition ITC 2007. 189-202 - Christos Gogos
An improved multi-staged algorithmic process for the solution of the examination timetabling problem. 203-221 - Dries R. Goossens, Jeroen Beliën
Comparing league formats with respect to match importance in Belgian football. 223-240 - Jeffrey H. Kingston:
Resource assignment in high school timetabling. 241-254 - Gerald Lach, Marco E. Lübbecke
Curriculum based course timetabling: new solutions to Udine benchmark instances. 255-272 - Rhyd Lewis
A time-dependent metaheuristic algorithm for post enrolment-based course timetabling. 273-289 - Barry McCollum, Paul McMullan, Andrew J. Parkes
A new model for automated examination timetabling. 291-315 - Ryuhei Miyashiro
An approximation algorithm for the traveling tournament problem. 317-324 - Clemens Nothegger, Alfred Mayer, Andreas M. Chwatal, Günther R. Raidl:
Solving the post enrolment course timetabling problem by ant colony optimization. 325-339 - Tiago Cardal Pais, Paula Amaral
Managing the tabu list length using a fuzzy inference system: an application to examination timetabling. 341-363 - Sanja Petrovic, Greet Vanden Berghe:
A comparison of two approaches to nurse rostering problems. 365-384 - Gerhard Post, Samad Ahmadi, Sophia Daskalaki, Jeffrey H. Kingston, Jari Kyngäs, Cimmo Nurmi, David Ranson:
An XML format for benchmarks in High School Timetabling. 385-397 - Haroldo G. Santos
Strong bounds with cut and column generation for class-teacher timetabling. 399-412 - Markus Triska, Nysret Musliu
An effective greedy heuristic for the Social Golfer Problem. 413-425 - Markus Triska, Nysret Musliu
An improved SAT formulation for the social golfer problem. 427-438 - J. J. J. van den Broek, Cor A. J. Hurkens:
An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007. 439-454
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: