Local search and constraint programming for the post enrolment-based course timetabling problem
- 6 June 2010
- journal article
- research article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 194 (1), 111-135
- https://doi.org/10.1007/s10479-010-0737-7
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling ProblemPublished by Springer Science and Business Media LLC ,2007
- Global Constraint Catalogue: Past, Present and FutureConstraints, 2007
- An effective hybrid algorithm for university course timetablingJournal of Scheduling, 2006
- A survey of local search methods for graph coloringComputers & Operations Research, 2006
- Neighborhood Portfolio Approach for Local Search Applied to Timetabling ProblemsJournal of Mathematical Modelling and Algorithms, 2005
- Decomposition and Learning for a Hard Real Time Task Allocation ProblemLecture Notes in Computer Science, 2004
- Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness CostsLecture Notes in Computer Science, 2003
- Recent developments in practical course timetablingLecture Notes in Computer Science, 1998
- Extending chip in order to solve complex scheduling and placement problemsMathematical and Computer Modelling, 1993
- An introduction to timetablingEuropean Journal of Operational Research, 1985