default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 218
Volume 218, Number 1, July 2014
- Barry McCollum, Edmund K. Burke
:
The practice and theory of automated timetabling. 1-2 - Syariza Abdul-Rahman, Edmund K. Burke, Andrzej Bargiela, Barry McCollum, Ender Özcan:
A constructive approach to examination timetabling based on adaptive decomposition and ordering. 3-21 - Mohammed Azmi Al-Betar, Ahamad Tajudin Khader, Iyad Abu Doush:
Memetic techniques for examination timetabling. 23-50 - Eyjólfur Ingi Ásgeirsson:
Bridging the gap between self schedules and feasible schedules in staff scheduling. 51-69 - Roberto Javier Asín Achá, Robert Nieuwenhuis:
Curriculum-based course timetabling with SAT and MaxSAT. 71-91 - Ralf Borndörfer, Berkan Erol, Thomas Graffagnino, Thomas Schlechte, Elmar Swarat:
Optimizing the Simplon railway corridor. 93-106 - Peter Brucker, Rong Qu:
Network flow models for intraday personnel scheduling problems. 107-114 - Bregje Buiteveld, Erik van Holland, Gerhard Post, Dirk Smit:
Round-robin tournaments with homogeneous rounds. 115-128 - Edmund K. Burke, Rong Qu, Amr Soghier:
Adaptive selection of heuristics for improving exam timetables. 129-145 - Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
The generalized balanced academic curriculum problem with heterogeneous classes. 147-163 - Ademir Aparecido Constantino, Dario Landa-Silva, Everton Luiz de Melo, Candido Ferreira Xavier de Mendonça Neto, Douglas Baroni Rizzato, Wesley Romão:
A heuristic algorithm based on multi-assignment procedures for nurse scheduling. 165-183 - Federico Della Croce, Fabio Salassa:
A variable neighborhood search based matheuristic for nurse rostering problems. 185-199 - Maik Günther, Volker Nissen:
A comparison of three heuristics on a practical case of sub-daily staff scheduling. 201-219 - Stefaan Haspeslagh, Patrick De Causmaecker, Andrea Schaerf, Martin Stølevik:
The first international nurse rostering competition 2010. 221-236 - Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro:
A 2.75-approximation algorithm for the unconstrained traveling tournament problem. 237-247 - Jeffrey H. Kingston:
Timetable construction: the algorithms and complexity perspective. 249-259 - Nelishia Pillay:
A survey of school timetabling research. 261-293 - Gerhard Post, Jeffrey H. Kingston, Samad Ahmadi, Sophia Daskalaki, Christos Gogos, Jari Kyngäs, Cimmo Nurmi, Nysret Musliu, Nelishia Pillay, Haroldo G. Santos, Andrea Schaerf:
XHSTT: an XML archive for high school timetabling problems in different countries. 295-301 - Pieter Smet, Burak Bilgin, Patrick De Causmaecker, Greet Vanden Berghe:
Modelling and evaluation issues in nurse rostering. 303-326 - Anthony Wehrer, Jay Yellen:
The design and implementation of an interactive course-timetabling system. 327-345 - Stephan Westphal, Karl Noparlik:
A 5.875-approximation for the Traveling Tournament Problem. 347-360
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-11-15 19:21 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:
