On the public citation graph
Timetabling Problems and the Effort Towards Generic Algorithms: A Comprehensive Survey
0 signed · 80 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-36605-9_31openalex-snapshot
Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art
inferredcites →https://doi.org/10.1007/978-3-319-91086-4_14openalex-snapshot
A Classification of Hyper-Heuristic Approaches: Revisited
inferredcites →https://doi.org/10.1007/s00291-007-0097-0openalex-snapshot
A survey of metaheuristic-based techniques for University Timetabling problems
inferredcites →https://doi.org/10.1007/s00500-013-1096-5openalex-snapshot
A greedy gradient-simulated annealing selection hyper-heuristic
inferredcites →https://doi.org/10.1007/s00500-016-2225-8openalex-snapshot
An adaptive guided variable neighborhood search based on honey-bee mating optimization algorithm for the course timetabling problem
inferredcites →https://doi.org/10.1007/s10288-011-0182-8openalex-snapshot
A simulated annealing hyper-heuristic methodology for flexible decision support
inferredcites →https://doi.org/10.1007/s10479-010-0696-zopenalex-snapshot
A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
inferredcites →https://doi.org/10.1007/s10479-010-0703-4openalex-snapshot
Applying the threshold accepting metaheuristic to curriculum based course timetabling
inferredcites →https://doi.org/10.1007/s10479-010-0712-3openalex-snapshot
An improved multi-staged algorithmic process for the solution of the examination timetabling problem
inferredcites →https://doi.org/10.1007/s10479-011-0867-6openalex-snapshot
Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
inferredcites →https://doi.org/10.1007/s10479-012-1078-5openalex-snapshot
Solving the post enrolment course timetabling problem by ant colony optimization
inferredcites →https://doi.org/10.1007/s10479-012-1140-3openalex-snapshot
Adaptive selection of heuristics for improving exam timetables
inferredcites →https://doi.org/10.1007/s10479-013-1321-8openalex-snapshot
A survey of school timetabling research
inferredcites →https://doi.org/10.1007/s10479-013-1340-5openalex-snapshot
The Third International Timetabling Competition
inferredcites →https://doi.org/10.1007/s10479-013-1500-7openalex-snapshot
Memetic techniques for examination timetabling
inferredcites →https://doi.org/10.1007/s10479-014-1660-0openalex-snapshot
A stochastic local search algorithm with adaptive acceptance for high-school timetabling
inferredcites →https://doi.org/10.1007/s10479-014-1685-4openalex-snapshot
GOAL solver: a hybrid local search based solver for high school timetabling
inferredcites →https://doi.org/10.1007/s10479-014-1688-1openalex-snapshot
A review of hyper-heuristics for educational timetabling
inferredcites →https://doi.org/10.1007/s10479-015-2061-8openalex-snapshot
Feature-based tuning of single-stage simulated annealing for examination timetabling
inferredcites →https://doi.org/10.1007/s10479-016-2151-2openalex-snapshot
Adaptive large neighborhood search for the curriculum-based course timetabling problem
inferredcites →https://doi.org/10.1007/s10479-017-2625-xopenalex-snapshot
Automated generation of constructive ordering heuristics for educational timetabling
inferredcites →https://doi.org/10.1007/s10479-017-2688-8openalex-snapshot
Practices in timetabling in higher education institutions: a systematic review
inferredcites →https://doi.org/10.1007/s10489-011-0309-9openalex-snapshot
A graph coloring constructive hyper-heuristic for examination timetabling problems
inferredcites →https://doi.org/10.1007/s10489-013-0422-zopenalex-snapshot
Adaptive selection of heuristics for assigning time slots and rooms in exam timetables
inferredcites →https://doi.org/10.1007/s10489-013-0444-6openalex-snapshot
Population based Local Search for university course timetabling problems
inferredcites →https://doi.org/10.1007/s10489-014-0615-0openalex-snapshot
Hybridising heuristics within an estimation distribution algorithm for examination timetabling
inferredcites →https://doi.org/10.1007/s10489-020-01833-xopenalex-snapshot
A hybrid algorithm for the university course timetabling problem using the improved parallel genetic algorithm and local search
inferredcites →https://doi.org/10.1007/s10732-010-9154-yopenalex-snapshot
A hybrid metaheuristic approach to the university course timetabling problem
inferredcites →https://doi.org/10.1007/s10878-012-9521-8openalex-snapshot
On the performance of Scatter Search for post-enrolment course timetabling problems
inferredcites →https://doi.org/10.1007/s10951-011-0224-2openalex-snapshot
Design and statistical analysis of a hybrid local search algorithm for course timetabling
inferredcites →https://doi.org/10.1007/s10951-011-0258-5openalex-snapshot
A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice
inferredcites →https://doi.org/10.1007/s10951-013-0352-yopenalex-snapshot
An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
inferredcites →https://doi.org/10.1007/s10951-015-0458-5openalex-snapshot
Late acceptance hill-climbing for high school timetabling
inferredcites →https://doi.org/10.1007/s10951-016-0469-xopenalex-snapshot
A Step Counting Hill Climbing Algorithm applied to University Examination Timetabling
inferredcites →https://doi.org/10.1007/s10951-022-00740-yopenalex-snapshot
Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
inferredcites →https://doi.org/10.1007/s10951-022-00747-5openalex-snapshot
Simulated annealing with penalization for university course timetabling
inferredcites →https://doi.org/10.1007/s12597-020-00444-xopenalex-snapshot
An effective hybrid local search approach for the post enrolment course timetabling problem
inferredcites →https://doi.org/10.1007/s12652-020-02047-2openalex-snapshot
A $$\beta $$-hill climbing optimizer for examination timetabling problem
inferredcites →https://doi.org/10.1016/j.asoc.2013.04.010openalex-snapshot
A hybrid self-adaptive bees algorithm for examination timetabling problems
inferredcites →https://doi.org/10.1016/j.asoc.2015.11.043openalex-snapshot
Iterated local search using an add and delete hyper-heuristic for university course timetabling
inferredcites →https://doi.org/10.1016/j.asoc.2021.107624openalex-snapshot
Competition-guided multi-neighborhood local search algorithm for the university course timetabling problem
inferredcites →https://doi.org/10.1016/j.cie.2019.106040openalex-snapshot
A survey on new generation metaheuristic algorithms
inferredcites →https://doi.org/10.1016/j.cor.2011.09.014openalex-snapshot
Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem
inferredcites →https://doi.org/10.1016/j.cor.2013.11.012openalex-snapshot
Variable Neighborhood Search based algorithms for high school timetabling
inferredcites →https://doi.org/10.1016/j.cor.2014.09.005openalex-snapshot
Hybrid bee colony optimization for examination timetabling problems
inferredcites →https://doi.org/10.1016/j.cor.2017.09.014openalex-snapshot
Random partial neighborhood search for the post-enrollment course timetabling problem
inferredcites →https://doi.org/10.1016/j.cor.2018.02.009openalex-snapshot
A cellular memetic algorithm for the examination timetabling problem
inferredcites →https://doi.org/10.1016/j.cor.2021.105300openalex-snapshot
Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
inferredcites →https://doi.org/10.1016/j.ejor.2011.08.006openalex-snapshot
A honey-bee mating optimization algorithm for educational timetabling problems
inferredcites →https://doi.org/10.1016/j.ejor.2014.03.046openalex-snapshot
Effective learning hyper-heuristics for the course timetabling problem
inferredcites →https://doi.org/10.1016/j.ejor.2014.11.002openalex-snapshot
Search with evolutionary ruin and stochastic rebuild: A theoretic framework and a case study on exam timetabling
inferredcites →https://doi.org/10.1016/j.ejor.2017.01.040openalex-snapshot
Improved local search approaches to solve the post enrolment course timetabling problem
inferredcites →https://doi.org/10.1016/j.ejor.2017.01.042openalex-snapshot
A methodology for determining an effective subset of heuristics in selection hyper-heuristics
inferredcites →https://doi.org/10.1016/j.ejor.2022.11.046openalex-snapshot
The international timetabling competition on sports timetabling (ITC2021)
inferredcites →https://doi.org/10.1016/j.eswa.2015.02.059openalex-snapshot
Solving high school timetabling problems worldwide using selection hyper-heuristics
inferredcites →https://doi.org/10.1016/j.eswa.2018.12.048openalex-snapshot
A fast simulated annealing algorithm for the examination timetabling problem
inferredcites →https://doi.org/10.1016/j.eswa.2020.113943openalex-snapshot
A survey of the state-of-the-art of optimisation methodologies in school timetabling problems
inferredcites →https://doi.org/10.1016/j.ins.2011.12.018openalex-snapshot
On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems
inferredcites →https://doi.org/10.1016/j.ins.2014.05.039openalex-snapshot
A new hybrid imperialist swarm-based optimization algorithm for university timetabling problems
inferredcites →https://doi.org/10.1016/j.ins.2014.10.045openalex-snapshot
Population based Monte Carlo tree search hyper-heuristic for combinatorial optimization problems
inferredcites →https://doi.org/10.1016/j.ins.2022.11.008openalex-snapshot
An investigation of F-Race training strategies for cross domain optimisation with memetic algorithms
inferredcites →https://doi.org/10.1016/j.jksuci.2021.06.016openalex-snapshot
Hybrid intelligent water Drops algorithm for examination timetabling problem
inferredcites →https://doi.org/10.1016/j.jocs.2014.04.002openalex-snapshot
University course timetabling using hybridized artificial bee colony with hill climbing optimizer
inferredcites →https://doi.org/10.1016/j.swevo.2012.06.004openalex-snapshot
Hybrid particle swarm optimization transplanted into a hyper-heuristic structure for solving examination timetabling problem
inferredcites →https://doi.org/10.1057/jors.1996.37openalex-snapshot
Examination Timetabling: Algorithmic Strategies and Applications
inferredcites →https://doi.org/10.1057/jors.2011.12openalex-snapshot
Evolving hyper-heuristics for the uncapacitated examination timetabling problem
inferredcites →https://doi.org/10.1080/01605682.2018.1468862openalex-snapshot
Simulated annealing with improved reheating and learning for the post enrolment course timetabling problem
inferredcites →https://doi.org/10.1108/ijicc-02-2015-0005openalex-snapshot
A memetic algorithm based on hyper-heuristics for examination timetabling problems
inferredcites →https://doi.org/10.1109/access.2021.3100613openalex-snapshot
A Survey of University Course Timetabling Problem: Perspectives, Trends and Opportunities
inferredcites →https://doi.org/10.1109/cyberneticscom55287.2022.9865647openalex-snapshot
Hybrid Whale Optimization Algorithm for Solving Timetabling Problems of ITC 2019
inferredcites →https://doi.org/10.1109/i2cacis57635.2023.10193383openalex-snapshot
International Timetabling Competition 2019: A Systematic Literature Review
inferredcites →https://doi.org/10.1109/tcyb.2014.2323936openalex-snapshot
A Dynamic Multiarmed Bandit-Gene Expression Programming Hyper-Heuristic for Combinatorial Optimization Problems
inferredcites →https://doi.org/10.1109/tevc.2013.2281527openalex-snapshot
Grammatical Evolution Hyper-Heuristic for Combinatorial Optimization Problems
inferredcites →https://doi.org/10.1109/tevc.2020.2991717openalex-snapshot
A Unified Framework of Graph-Based Evolutionary Multitasking Hyper-Heuristic
inferredcites →https://doi.org/10.1109/tsmcc.2011.2174356openalex-snapshot
University Course Timetabling Using a Hybrid Harmony Search Metaheuristic Algorithm
inferredcites →https://doi.org/10.1287/ijoc.2015.0680openalex-snapshot
An Adaptive Flex-Deluge Approach to University Exam Timetabling
inferredcites →https://doi.org/10.1504/ijbic.2016.081327openalex-snapshot
Incorporating chaos into the developmental approach for solving the examination timetabling problem
inferredcites →https://doi.org/10.1504/ijbic.2017.087918openalex-snapshot
An adaptive coevolutionary memetic algorithm for examination timetabling problems
inferredcites →https://doi.org/10.3390/computation8020046openalex-snapshot
Addressing Examination Timetabling Problem Using a Partial Exams Approach in Constructive and Improvement
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1145/3793811.3793816openalex-snapshot
A Hybrid Genetic Algorithm and Simulated Annealing Approach for Optimal University Course Timetabling
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.