A time-predefined approach to course timetabling

DOI10.2298/YJOR0302139BzbMath1055.90039OpenAlexW2043926068MaRDI QIDQ3155573

Yuri Bykov, Sanja Petrovic, J. P. Newall, Edmund Kieran Burke

Publication date: 17 January 2005

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

Full work available at URL: https://doi.org/10.2298/yjor0302139b

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items (13)

Comparison of metaheuristic algorithms for examination timetabling problem ⋮ A decomposed metaheuristic approach for a real-world university timetabling problem ⋮ Random partial neighborhood search for the post-enrollment course timetabling problem ⋮ An effective hybrid algorithm for university course timetabling ⋮ An Adaptive Flex-Deluge Approach to University Exam Timetabling ⋮ A simulated annealing hyper-heuristic methodology for flexible decision support ⋮ Improved local search approaches to solve the post enrolment course timetabling problem ⋮ A survey of metaheuristic-based techniques for university timetabling problems ⋮ A harmony search algorithm for university course timetabling ⋮ Applying the threshold accepting metaheuristic to~curriculum based course timetabling ⋮ Solving the post enrolment course timetabling problem by ant colony optimization ⋮ On the performance of scatter search for post-enrolment course timetabling problems ⋮ Hybrid heuristics for examination timetabling problem

This page was built for publication: A time-predefined approach to course timetabling