Abstract
This paper concerns the application of a parallel tabu search algorithm to solve the general problem of timetabling. The problem of timetabling (also known as scheduling) was first expressed as a graph coloring problem and then good approximate solutions were obtained with use of concurrent metaheuristic algorithm for GPU (Graphics Processing Unit). © 2014 Springer International Publishing.
Cite
CITATION STYLE
Bozejko, W., Gniewkowski, Ł., & Wodecki, M. (2014). Solving timetabling problems on GPU. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8468 LNAI, pp. 445–455). Springer Verlag. https://doi.org/10.1007/978-3-319-07176-3_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
