Solving the examination timetabling problem in GPUs
From MaRDI portal
Publication:1736620
DOI10.3390/a7030295zbMath1461.90179OpenAlexW2080574925MaRDI QIDQ1736620
Vasileios Kolonias, George Goulas, Christos Gogos, Efthymios Housos, Panayiotis Alefragis
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a7030295
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
A step counting hill climbing algorithm applied to university examination timetabling ⋮ Feature-based tuning of single-stage simulated annealing for examination timetabling ⋮ Comments on: ``An overview of curriculum-based course timetabling ⋮ An overview of curriculum-based course timetabling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving examination timetabling problems through adaption of heuristic orderings
- A survey of search methodologies and automated system development for examination timetabling
- A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
- A robust simulated annealing based examination timetabling system.
- Using tabu search with longer-term memory and relaxation to create examination timetables.
- An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
- Constraint satisfaction problems: Algorithms and applications
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- ECC2K-130 on NVIDIA GPUs
- Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
- Cellular Genetic Algorithm on Graphic Processing Units
- Parallel metaheuristics: recent advances and new trends
- GPU Computing for Parallel Local Search Metaheuristic Algorithms
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Handbook of metaheuristics
This page was built for publication: Solving the examination timetabling problem in GPUs