Memetic techniques for examination timetabling
From MaRDI portal
Publication:475166
DOI10.1007/s10479-013-1500-7zbMath1301.90024OpenAlexW2092487519MaRDI QIDQ475166
Ahamad Tajudin Khader, Iyad Abu Doush, Mohammed Azmi Al-Betar
Publication date: 26 November 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1500-7
Related Items
Operational research in education ⋮ A column generation approach for solving the examination-timetabling problem ⋮ A practical three‐phase ILP approach for solving the examination timetabling problem ⋮ An Adaptive Flex-Deluge Approach to University Exam Timetabling ⋮ Recognizing faces prone to occlusions and common variations using optimal face subgraphs
Uses Software
Cites Work
- Unnamed Item
- Novel selection schemes for harmony search
- An analysis of selection methods in memory consideration for harmony search
- Solving examination timetabling problems through adaption of heuristic orderings
- A survey of search methodologies and automated system development for examination timetabling
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
- Hybrid variable neighbourhood approaches to university exam timetabling
- A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- Monte Carlo hyper-heuristics for examination timetabling
- A harmony search algorithm for university course timetabling
- An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
- A graph-based hyper-heuristic for educational timetabling problems
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- Novel Local-Search-Based Approaches to University Examination Timetabling
- Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
- New methods to color the vertices of a graph
This page was built for publication: Memetic techniques for examination timetabling