Local search and constraint programming for the post enrolment-based course timetabling problem
From MaRDI portal
Publication:1761894
DOI10.1007/S10479-010-0737-7zbMATH Open1251.90120OpenAlexW2147440785MaRDI QIDQ1761894FDOQ1761894
Barry O'Sullivan, Hadrien Cambazard, Emmanuel Hebrard
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization by Simulated Annealing
- A survey of local search methods for graph coloring
- Logic-based Benders decomposition
- Global constraint catalogue: past, present and future
- Neighborhood portfolio approach for local search applied to timetabling problems
- An effective hybrid algorithm for university course timetabling
- Principles and Practice of Constraint Programming – CP 2004
- An introduction to timetabling
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- Principles and Practice of Constraint Programming – CP 2004
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
- Evolutionary Computation in Combinatorial Optimization
Cited In (15)
- Logic-Based Benders Decomposition for Large-Scale Optimization
- A matheuristic for customized multi-level multi-criteria university timetabling
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics
- Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
- Random partial neighborhood search for the post-enrollment course timetabling problem
- Improved local search approaches to solve the post enrolment course timetabling problem
- An effective hybrid local search approach for the post enrolment course timetabling problem
- A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
- On the performance of scatter search for post-enrolment course timetabling problems
- Simulated annealing with penalization for university course timetabling
- Local search and constraint programming for a real-world examination timetabling problem
- Solving university course timetabling problems using constriction particle swarm optimization with local search
- Educational timetabling: problems, benchmarks, and state-of-the-art results
Uses Software
Recommendations
- A time-dependent metaheuristic algorithm for post enrolment-based course timetabling 👍 👎
- Local search and constraint programming for a real-world examination timetabling problem 👍 👎
- Solving university course timetabling problems using constriction particle swarm optimization with local search 👍 👎
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem 👍 👎
- Random partial neighborhood search for the post-enrollment course timetabling problem 👍 👎
- 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 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Local search and constraint programming for the post enrolment-based course timetabling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761894)
