Solving Timetabling Problems on GPU

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).

[1]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[2]  B. Adenso-Díaz.  Restricted neighborhood in the tabu search for the flowshop problem , 1992 .

[3]  Jin-Kao Hao,et al.  Adaptive Tabu Search for course timetabling , 2010, Eur. J. Oper. Res..

[4]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[5]  Wojciech Bozejko,et al.  Solving the Flexible Job Shop Problem on Multi-GPU , 2012, ICCS.

[6]  Sanja Petrovic,et al.  A graph-based hyper-heuristic for educational timetabling problems , 2007, Eur. J. Oper. Res..

[7]  Lj Stuart,et al.  International Journal of Computer Application , 2014 .

[8]  Wojciech Bożejko,et al.  Multi-GPU Tabu Search Metaheuristic for the Flexible Job Shop Scheduling Problem , 2014 .

[9]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling VI, 6th International Conference, PATAT 2006, Brno, Czech Republic, August 30 - September 1, 2006, Revised Selected Papers , 2007, PATAT.

[10]  Ramón Alvarez-Valdés,et al.  Design and implementation of a course scheduling system using Tabu Search , 2002, Eur. J. Oper. Res..

[11]  Wen-mei W. Hwu,et al.  GPU computing gems , 2011 .

[12]  Salwani Abdullah,et al.  On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems , 2012, Inf. Sci..

[13]  Michael Sampels,et al.  Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art , 2003, EvoWorkshops.

[14]  Wojciech Bozejko,et al.  Parallel Genetic Algorithm for Minimizing Total Weighted Completion Time , 2004, ICAISC.

[15]  John Tartar,et al.  Graph coloring conditions for the existence of solutions to the timetable problem , 1974, CACM.

[16]  Edmund K. Burke,et al.  The practice and theory of automated timetabling , 2014, Ann. Oper. Res..

[17]  Mohammad Ali Badamchizadeh,et al.  Hybrid particle swarm optimization transplanted into a hyper-heuristic structure for solving examination timetabling problem , 2012, Swarm Evol. Comput..

[18]  Jörg H. Siekmann,et al.  Artificial Intelligence and Soft Computing - ICAISC 2004 , 2004, Lecture Notes in Computer Science.

[19]  G. Asham Mina,et al.  Trans Genetic Coloring Approach for Timetabling Problem , 2011 .

[20]  Andrzej Bargiela,et al.  Adaptive linear combination of heuristic orderings in constructing examination timetables , 2014, Eur. J. Oper. Res..

[21]  Wojciech Bozejko,et al.  The new golf neighborhood for the exible job shop problem , 2010, ICCS.