Skip to main content
SpringerLink
Log in

Solving Timetabling Problems on GPU

  • Conference paper
Artificial Intelligence and Soft Computing (ICAISC 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8468))

Included in the following conference series:

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

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adenso-Diaz, B.: Restricted neighbourhood in the tabu search for the flow shop problem. European Journal of Operational Research 62, 27–37 (1992)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Chapter  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Chapter  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research 91, 160–175 (1996)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  18. Wen-Mei, H.: GPU Computing Gems. Morgan Kaufmann Publ. (2011)

    Google Scholar 

  19. Zhipeng, L., Jin-Kao, H.: Adaptive Tabu Search for course timetabling. European Journal of Operational Research 200, 235–244 (2010)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Janiszewskiego 11-17, 50-372, Wrocław, Poland

    Wojciech Bożejko & Łukasz Gniewkowski

  2. Institute of Computer Science, University of Wrocław, Joliot-Curie 15, 50-383, Wrocław, Poland

    Mieczysław Wodecki

Authors
  1. Wojciech Bożejko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Łukasz Gniewkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mieczysław Wodecki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Częstochowa University of Technology, Armii Krajowej 36, 42-200, Częstochowa, Poland

    Leszek Rutkowski  & Rafał Scherer  & 

  2. Częstochowa University of Technology, 42-200, Częstochowa, Poland

    Marcin Korytkowski

  3. AGH University of Science and Technology, Mickiewicza 30, 30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  4. Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California Berkeley, 94720-1776, Berkeley, CA, USA

    Lotfi A. Zadeh

  5. Computational Intelligence Laboratory, Electrical and Computer Engineering, University of Louisville, 405 Lutz Hall, 40292, Louisville, KY, USA

    Jacek M. Zurada

Rights and permissions

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

Publish with us

Policies and ethics

Search

Navigation