Examination timetabling problem with scarce resources: a case study

KESKİN M. E. , DÖYEN A., Akyer H., GÜLER M. G.

EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, vol.12, no.6, pp.855-874, 2018 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 12 Issue: 6
  • Publication Date: 2018
  • Doi Number: 10.1504/ejie.2018.096394
  • Page Numbers: pp.855-874
  • Keywords: examination timetabling, scarce resources, mixed-integer programming, optimisation, decomposition, two stage solution strategy, heuristic, industrial engineering, COLONY OPTIMIZATION, ALGORITHM


Examination timetabling problem (ETP) is one of the hardest administrative tasks that has to be undertaken at each semester in all faculties. Although the major structure of the problem remains intact, requirements may change from faculty to faculty causing major changes in the solution procedures. The number of academic staff and the level of infrastructures of newly established universities cannot keep up with the increasing number of departments and students. This scarcity brings several additional constraints to the ETP. In this study, we propose a two stage solution procedure for the ETP of such universities. We apply our solution method to a real problem. We show that better feasible solutions can be found in shorter computation times compared to commercial softwares. Moreover we show that the total examination period length can be reduced from seven days to six days with the proposed method.