Logo PTI
Polish Information Processing Society
Logo FedCSIS

Annals of Computer Science and Information Systems, Volume 15

Proceedings of the 2018 Federated Conference on Computer Science and Information Systems

Lecturers' competences configuration model for the timetabling problem

DOI: http://dx.doi.org/10.15439/2018F143

Citation: Proceedings of the 2018 Federated Conference on Computer Science and Information Systems, M. Ganzha, L. Maciaszek, M. Paprzycki (eds). ACSIS, Vol. 15, pages 441–444 ()

Full text

Abstract. The article presents the problem of academic teachers' competences configuration in the context of the university course timetabling problem (UCTP). Usually when solving UCTP, the set of available academic teachers and the competences they have is defined. The sets of lecture rooms, subjects (courses), student groups, time-slots, etc. are also known. Problems can emerge when it is not possible to find a satisfactory UTCP solution due to the missing sufficient number of specific academic teachers' (lecturers') competences, which is reflected in the possibility to teach specific classes (courses). In order to detect early such a situation and effectively manage the available and required lecturers' competences, a mathematical model of lecturers' competences configuration has been formulated in the form of a MILP (Mixed Integer Linear Programming) problem. Its solution has a direct impact on UTCP. The article also presents the implementation of the model in the LINGO solver environment and computational experiments.

References

  1. A. Schrijver, “Theory of Linear and Integer Programming”. John Wiley & sons, ISBN:0- 471-98232-6, 1998.
  2. C. C. Gotlib, “The construction of class-teacher timetables”, Proceedings of IFIP Congress, 62, 1963, 73–77.
  3. R. J. Willemen, “School timetable construction: algorithms and complexity” Printed by Universiteitsdrukkerij Technische Universiteit Eindhoven, 2002, http://dx.doi.org/10.6100/IR553569.
  4. J. H. Kingston, “Timetable Construction: The Algorithms and Complexity Perspective”, Ann Oper Res, 2014, 218-249, https://doi.org/10.1007/s10479-012-1160-z
  5. M. Ilic, P. Spalevic, S. Ilic, M. Veinovic, Z. Milivojevic, B. Prlincevic: “Data mining techniques for student timetable optimization”, INFOTEH-JAHORINA Vol. 14, March 2015, 578-583.
  6. H. Babaei, J. Karimpour, A. Hadidi, “A survey of approaches for university course timetabling problem”, Computers & Industrial Engineering 86, 2015, 43–59.
  7. T. A. Redl, “A study of university timetabling that blends graph coloring with the satisfaction of various essential and preferential conditions” Ph.D. Thesis, Rice University, Houston, 2004, Texas.
  8. H. Asmui, E.K. Burke, J.M Garibaldi, “Fuzzy multiple heuristic ordering for course timetabling”, The proceedings of the 5th United Kingdom workshop on computational intelligence (UKCI05), London, UK, 2005, 302–309.
  9. S. Abdullah, E.K. Burke, B. McColloum, “Using a randomised iterative improvement algorithm with composite neighborhood structures for university course timetabling. metaheuristic – Program in complex systems”, Optimization, 2007, 153–172.
  10. M. Mühlenthaler, “Fairness in Academic Course Timetabling”, Lecture Notes in Economics and Mathematical Systems 678, Springer International Publishing, Switzerland, 2015, http://dx.doi.org/10.1007/978-3-319-12799-6_2.
  11. Lindo, http://www.lindo.com/, Accessed May 04 2018.
  12. P. Sitek, I.E Nielsen J. Wikarek, “A Hybrid Multi-agent Approach to the Solving Supply Chain Problems”, Knowledge-Based and Intelligent Information & Engineering Systems 18th Annual Conference, KES-2014 Gdynia, Poland, Volume 35, 2014, 1557-1566,.http://dx.doi.org/https://doi.org/10.1016/ j.procs.2014.08.239
  13. P. Sitek, “A Hybrid Approach to the Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP)”, Automation, Robotics and Measuring Techniques. Advances in Intelligent Systems and Computing, 267. Springer, Cham, 2014, 251-263, http://dx.doi.org/https://doi.org/10.1007/978-3-319-05353-0_25.
  14. P. Sitek, J. Wikarek, “A multi-level approach to ubiquitous modeling and solving constraints in combinatorial optimization problems in production and distribution”, Applied Intelligence 48, 2018, 1344–1367, http://dx.doi.org/https://doi.org/ 10.1007/s10489-017-1107-9
  15. P. Sitek, J. Wikarek, P. Nielsen, “A constraint-driven approach to food supply chain management”, Industrial Management & Data Systems 117(9), 2017, 2115-2138, http://dx.doi.org/10.1108/IMDS-10-2016-0465/
  16. P. Sitek, "A hybrid multi-objective programming framework for modeling and optimization of supply chain problems", 2015 Federated Conference on Computer Science and Information Systems (FedCSIS), 2015, 1631-1640, http://dx.doi.org/https://doi.org/10.15439/2015F83