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).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adenso-Diaz, B.: Restricted neighbourhood in the tabu search for the flow shop problem. European Journal of Operational Research 62, 27–37 (1992)
Ahandani, M., Baghmisheh, M., Zadeh, M., Ghaemi, S.: Hybrid particle swarm optimization transplanted into a hyper-heuristic structure for solving examination timetabling problem. Swarm and Evolutionary Computation 7, 21–34 (2012)
Alvarez-Valdes, R., Crespo, E., Tamarit, J.M.: Design and implementation of a course scheduling system using Tabu Search. European Journal of Operational Research 137, 512–523 (2002)
Asham, M.G., Soliman, M.M., Ramadan, R.A.: Trans Genetic Coloring Approach for Timetabling Problem. International Journal of Computer Application (1), 17–25 (2011)
Bożejko, W., Gniewkowski, Ł.: Parallel tabu search algorithm for timetabling determination (in Polish). In: Knosala, R. (ed.) Innovations in Management and Production, Polish Production Management Society Publishing House (2013)
Bożejko, W., Uchroński, M., Wodecki, M.: Multi-GPU Tabu Search Metaheuristic for the Flexible Job Shop Scheduling Problem. In: Klempous, R., Nikodem, J., Chaczko, Z. (eds.) Topics in Intelligent Engineering and Informatics Series, vol. 6, pp. 43–60 (2014)
Bożejko, W., Wodecki, M.: Parallel genetic algorithm for minimizing total weighted completion time. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds.) ICAISC 2004. LNCS (LNAI), vol. 3070, pp. 400–405. Springer, Heidelberg (2004)
Bożejko, W., Uchroński, M., Wodecki, M.: The new golf neighborhood for the flexible job shop problem. In: Proceedings of the ICCS 2010. Procedia Computer Science, vol. 1, pp. 289–296 (2010)
Bożejko, W., Uchroński, M., Wodecki, M.: Solving the Flexible Job Shop Problem on Multi-GPU. In: Proceedings of ICCS 2012. Procedia Computer Science, vol. 9, pp. 2020–2023 (2012)
Burke, E., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A graph-based hyper-heuristic for educational timetabling problems. European Journal of Operational Research 176, 177–192 (2007)
Burke, E., Rudová, H.: Practice and Theory of Automated Timetabling. In: Burke, E.K., Rudová, H. (eds.) PATAT 2007. LNCS, vol. 3867, Springer, Heidelberg (2007)
Grabowski, J., Wodecki, M.: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers & Operations Research 31, 1891–1909 (2004)
Neufeld, G.A., Tartar, J.: Graph coloring conditions for the existence of solutions to the timetable problem. Communications of the ACM 17(8), 450–453 (1974)
Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research 91, 160–175 (1996)
Rahman, S.A., Bargiela, A., Burke, E.K., Özcan, E., McCollum, B., McMullan, P.: Adaptive linear combination of heuristic orderings in constructing examination timetables. European Journal of Operational Research 232(2), 287–297 (2014)
Salwani, A., Hamza, T.: On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems. Information Sciences 191, 146–168 (2012)
Socha, K., Sampels, M., Manfrin, M.: Ant algorithms for the university course timetabling problem with regard to the state-of-the-art. In: Raidl, G.R., et al. (eds.) EvoWorkshops 2003. LNCS, vol. 2611, pp. 334–345. Springer, Heidelberg (2003)
Wen-Mei, H.: GPU Computing Gems. Morgan Kaufmann Publ. (2011)
Zhipeng, L., Jin-Kao, H.: Adaptive Tabu Search for course timetabling. European Journal of Operational Research 200, 235–244 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Bożejko, W., Gniewkowski, Ł., Wodecki, M. (2014). Solving Timetabling Problems on GPU. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2014. Lecture Notes in Computer Science(), vol 8468. Springer, Cham. https://doi.org/10.1007/978-3-319-07176-3_39
Download citation
DOI: https://doi.org/10.1007/978-3-319-07176-3_39
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07175-6
Online ISBN: 978-3-319-07176-3
eBook Packages: Computer ScienceComputer Science (R0)