An effective hybrid local search approach for the post enrolment course timetabling problem
From MaRDI portal
Publication:2656559
DOI10.1007/s12597-020-00444-xOpenAlexW3035833550MaRDI QIDQ2656559
Nasser R. Sabar, Salwani Abdullah, Graham Kendall, Say Leng Goh
Publication date: 11 March 2021
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: http://eprints.ums.edu.my/25976/1/An%20effective%20hybrid%20local%20search%20approach%20for%20the%20post%20enrolment%20course%20timetabling%20problem.pdf
Related Items (2)
Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ A matheuristic for customized multi-level multi-criteria university timetabling
Cites Work
- Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
- An introduction to timetabling
- An effective hybrid algorithm for university course timetabling
- Complexity of some special types of timetabling problems
- Random partial neighborhood search for the post-enrollment course timetabling problem
- Improved local search approaches to solve the post enrolment course timetabling problem
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Solving the post enrolment course timetabling problem by ant colony optimization
- Variants of simulated annealing for the examination timetabling problem
- A clique-based algorithm for constructing feasible timetables
This page was built for publication: An effective hybrid local search approach for the post enrolment course timetabling problem
