A Data-Driven Approach to Modeling and Solving Academic Teachers’ Competences Configuration Problem

  • Jarosław Wikarek
  • Paweł SitekEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11431)


Before starting the subsequent academic year, the management staff from each organizational unit (faculty, department, research unit, etc.) must solve the university course timetabling problem (UCTP). UCTP belongs to the class of NP-difficult computational problems, thus its optimal solution becomes a challenge, even for small organizational units. Additionally, the process of searching for solutions is complicated by the need to take account of additional constraints resulting from local conditions, teachers’ and students’ preferences, etc. as well as held limited resources. For the management of a given organizational unit at the university, at the beginning of this process, it is important to find an answer to the question: are we able, given the held resources and existing constraints, to find any UCTP problem solution? Only in the next step we can consider finding an optimum solution according to the selected criterion. It seems that every missing resource can be supplemented (acquired, rented, modified etc.). It is a well-known fact from practice that the greatest problem is related to supplementing the missing competences of academic teachers. You can hire new teachers, already employed teachers can acquire new missing competences or you can manage the available set of competences in a different way. However, the solution to this problem (competences configuration) is key even before solving UCTP.

The article presents the data-driven based approach to modeling and solving the academic teachers’ competences configuration problem for the university’s organizational units of various sizes.


Timetabling problem Data-driven approach Mathematical programming Optimization 


  1. 1.
    Wikarek, J.: Lecturers’ competences configuration model for the timetabling problem. In: Ganzha, M., Maciaszek, L., Paprzycki, M. (eds.) Proceedings of the 2018 Federated Conference on Computer Science and Information Systems, ACSIS, vol. 15, pp. 441–444 (2018).
  2. 2.
    Gotlib, C.C.: The construction of class-teacher timetables. Proc. IFIP Cong. 62, 73–77 (1963)Google Scholar
  3. 3.
    Babaei, H., Karimpour, J., Hadidi, A.: A survey of approaches for university course timetabling problem. Comput. Ind. Eng. 86, 43–59 (2015)CrossRefGoogle Scholar
  4. 4.
    Redl, T.A.: A study of university timetabling that blends graph coloring with the satisfaction of various essential and preferential conditions. Ph.D. Thesis, Rice University, Houston, Texas (2004)Google Scholar
  5. 5.
    Asmui, H., Burke, E.K., Garibaldi, J.M.: Fuzzy multiple heuristic ordering for course timetabling. In: The proceedings of the 5th United Kingdom Workshop on Computational Intelligence (UKCI05), London, UK, pp. 302–309 (2005)Google Scholar
  6. 6.
    Abdullah, S., Burke, E.K., McCollum, B.: Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R.F., Reimann, M. (eds.) Metaheuristics. ORSIS, vol. 39, pp. 153–169. Springer, Boston, MA (2007). Scholar
  7. 7.
    Mühlenthaler, M.: Fairness in academic course timetabling. In: Mühlenthaler, M. (ed.) Fairness in academic course timetabling. LNE, vol. 678, pp. 75–105. Springer, Cham (2015). Scholar
  8. 8.
    Sitek, P., Wikarek, J.: A hybrid programming framework for modeling and solving constraint satisfaction and optimization problems. Sci. Program. 2016 (2016). Article ID 5102616. Scholar
  9. 9.
    Sitek, P., Wikarek, J.: A multi-level approach to ubiquitous modeling and solving constraints in combinatorial optimization problems in production and distribution. Appl. Intell. 48, 1344–1367 (2018). Scholar
  10. 10.
    Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Hoboken (1998). ISBN 0- 471-98232-6zbMATHGoogle Scholar
  11. 11.
    Home LINDO. Accessed 20 Dec 2018
  12. 12.
    Zwolińska, B., Grzybowska, K.: Shaping production change variability in relation to the utilized technology. In: 24th International Conference on Production Research (ICPR 2017), pp. 51–56 (2017). ISBN 978-1-60595-507-0, ISSN 2475-885XGoogle Scholar
  13. 13.
    Nielsen, I., Dang, Q.-V., Nielsen, P., Pawlewski, P.: Scheduling of mobile robots with preemptive tasks. In: Omatu, S., Bersini, H., Corchado, J.M., Rodríguez, S., Pawlewski, P., Bucciarelli, E. (eds.) Distributed Computing and Artificial Intelligence, 11th International Conference. AISC, vol. 290, pp. 19–27. Springer, Cham (2014). Scholar
  14. 14.
    Bocewicz, G., Nielsen, I., Banaszak, Z.: Production flows scheduling subject to fuzzy processing time constraints. Int. J. Comput. Integr. Manuf. 29(10), 1105–1127 (2016). Scholar
  15. 15.
    Sitek, P., Wikarek, J.: Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD) – model and implementation using hybrid approach. Ann. Oper. Res. 273, 257–277 (2017). Scholar
  16. 16.
    Kłosowski, G., Gola, A., Świć, A.: Application of fuzzy logic in assigning workers to production tasks. Distributed Computing and Artificial Intelligence, 13th International Conference. AISC, vol. 474, pp. 505–513. Springer, Cham (2016). Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Information SystemsKielce University of TechnologyKielcePoland

Personalised recommendations