Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.13091/844
Title: Examination timetabling problem with scarce resources: a case study
Authors: Keskin, Muhammed Emre
Döyen, Alper
Akyer, Hasan
Güler, Mehmet Güray
Keywords: Examination Timetabling
Scarce Resources
Mixed-Integer Programming
Optimisation
Decomposition
Two Stage Solution Strategy
Heuristic
Industrial Engineering
Colony Optimization
Algorithm
Issue Date: 2018
Publisher: INDERSCIENCE ENTERPRISES LTD
Abstract: 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.
URI: https://doi.org/10.1504/EJIE.2018.096394
https://hdl.handle.net/20.500.13091/844
ISSN: 1751-5254
1751-5262
Appears in Collections:Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections

Show full item record

CORE Recommender

SCOPUSTM   
Citations

3
checked on Jan 28, 2023

WEB OF SCIENCETM
Citations

4
checked on Dec 23, 2022

Page view(s)

32
checked on Jan 23, 2023

Google ScholarTM

Check

Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.