Solving the examination timetabling problem in GPUs

DOI10.3390/A7030295MaRDI QIDQ1736620zbMATH OpenOpenAlexFDO

Authors Vasileios Kolonias, George Goulas, Christos Gogos, Panayiotis Alefragis, Efthymios Housos

Publication date 26 March 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a7030295

zbMATH Keywords

evolutionary algorithmsCUDAGPU computingexamination timetabling problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A study of scheduling problems with preemptions on multi-core computers with GPU accelerators
• Analysis of a high-performance TSP solver on the GPU
• Solving path problems on the GPU

Cites work

• scientific article; zbMATH DE number 1728534 (Why is no real title available?)
• scientific article; zbMATH DE number 1728536 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 1240224 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• A robust simulated annealing based examination timetabling system.
• A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
• A survey of search methodologies and automated system development for examination timetabling
• An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Cellular genetic algorithm on graphic processing units
• Constraint satisfaction problems: Algorithms and applications
• ECC2K-130 on NVIDIA GPUs
• GPU Computing for Parallel Local Search Metaheuristic Algorithms
• Handbook of metaheuristics
• Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
• Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
• Parallel metaheuristics: recent advances and new trends
• Setting the research agenda in automated timetabling: the second international timetabling competition
• Solving examination timetabling problems through adaption of heuristic orderings
• Using tabu search with longer-term memory and relaxation to create examination timetables.

Cited in

(5)

• An overview of curriculum-based course timetabling
• Comments on: ``An overview of curriculum-based course timetabling
• Feature-based tuning of single-stage simulated annealing for examination timetabling
• A step counting hill climbing algorithm applied to university examination timetabling
• A multi-objective evolutionary algorithm for examination timetabling

Describes a project that uses

Uses Software

• EASEA
• CUDA

This page was built for publication: Solving the examination timetabling problem in GPUs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736620)