Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
Year of publication: |
2009
|
---|---|
Authors: | Qu, R. ; Burke, E. K. |
Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 60.2009, 9, p. 1273-1285
|
Subject: | Hochschule | Higher education institution | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research |
-
An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
Méndez-Díaz, Isabel, (2016)
-
An overview of curriculum-based course timetabling
Bettinelli, Andrea, (2015)
-
Benders' decomposition for curriculum-based course timetabling
Bagger, Niels-Christian Fink, (2018)
- More ...
-
A survey of search methodologies and automated system development for examination timetabling
Qu, R., (2009)
-
Hybrid variable neighbourhood approaches to university exam timetabling
Burke, E. K., (2010)
-
Hybrid variable neighbourhood approaches to university exam timetabling
Burke, E.K., (2010)
- More ...