Local search and constraint programming for the post enrolment-based course timetabling problem

DOI10.1007/s10479-010-0737-7zbMath1251.90120MaRDI QIDQ1761894

Hadrien Cambazard, Emmanuel Hebrard, Barry O'Sullivan

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0737-7

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Simulated annealing with penalization for university course timetabling, Educational timetabling: problems, benchmarks, and state-of-the-art results, A matheuristic for customized multi-level multi-criteria university timetabling, Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem, A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem, An ILP based heuristic for a generalization of the post-enrollment course timetabling problem, Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis, Random partial neighborhood search for the post-enrollment course timetabling problem, Solving university course timetabling problems using constriction particle swarm optimization with local search, A methodology for determining an effective subset of heuristics in selection hyper-heuristics, Improved local search approaches to solve the post enrolment course timetabling problem, On the performance of scatter search for post-enrolment course timetabling problems, An effective hybrid local search approach for the post enrolment course timetabling problem, Logic-Based Benders Decomposition for Large-Scale Optimization

Uses Software

• CHIP
• Chaff

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• An introduction to timetabling
• Global constraint catalogue: past, present and future
• An effective hybrid algorithm for university course timetabling
• Logic-based Benders decomposition
• A survey of local search methods for graph coloring
• Neighborhood portfolio approach for local search applied to timetabling problems
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• Evolutionary Computation in Combinatorial Optimization