Improved local search approaches to solve the post enrolment course timetabling problem
DOI10.1016/J.EJOR.2017.01.040zbMATH Open1403.90329OpenAlexW2581834059WikidataQ59569411 ScholiaQ59569411MaRDI QIDQ1753553FDOQ1753553
Authors: Say Leng Goh, Graham Kendall, Nasser R. Sabar 
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://eprints.nottingham.ac.uk/49525/
Recommendations
- Local search and constraint programming for the post enrolment-based course timetabling problem
- A Simulated Annealing Genetic Algorithm for Solving Timetable Problems
- Random partial neighborhood search for the post-enrollment course timetabling problem
- A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
combinatorial optimizationlocal searchtimetablingsimulated annealing with reheating (SAR)tabu search with sampling and perturbation (TSSP)
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- Optimization by simulated annealing
- Equation of state calculations by fast computing machines
- Future paths for integer programming and links to artificial intelligence
- A survey of metaheuristic-based techniques for university timetabling problems
- Title not available (Why is that?)
- An effective hybrid algorithm for university course timetabling
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Solving the post enrolment course timetabling problem by ant colony optimization
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
- Variants of simulated annealing for the examination timetabling problem
- An introduction to timetabling
- A time-predefined approach to course timetabling
Cited In (11)
- A decomposition-based algorithm for the double row layout problem
- A matheuristic for customized multi-level multi-criteria university timetabling
- An assignment problem and its application in education domain: a review and potential path
- A multi-objective mixed integer linear programming model for thesis defence scheduling
- Metaheuristics ``In the large
- Random partial neighborhood search for the post-enrollment course timetabling problem
- An effective hybrid local search approach for the post enrolment course timetabling problem
- Local search and constraint programming for the post enrolment-based course timetabling problem
- On the performance of scatter search for post-enrolment course timetabling problems
- Simulated annealing with penalization for university course timetabling
- Educational timetabling: problems, benchmarks, and state-of-the-art results
Uses Software
This page was built for publication: Improved local search approaches to solve the post enrolment course timetabling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753553)
