Please use this identifier to cite or link to this item:
https://hdl.handle.net/11499/11016
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Keskin, M.E. | - |
dc.contributor.author | Döyen, A. | - |
dc.contributor.author | Akyer, Hasan | - |
dc.contributor.author | Güler, M.G. | - |
dc.date.accessioned | 2019-08-16T13:34:29Z | |
dc.date.available | 2019-08-16T13:34:29Z | |
dc.date.issued | 2018 | - |
dc.identifier.issn | 1751-5254 | - |
dc.identifier.uri | https://hdl.handle.net/11499/11016 | - |
dc.identifier.uri | https://doi.org/10.1504/EJIE.2018.096394 | - |
dc.description.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. [Received 17 June 2017; Revised 23 April 2018; Accepted 7 July 2018]. Copyright © 2018 Inderscience Enterprises Ltd. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Inderscience Enterprises Ltd. | en_US |
dc.relation.ispartof | European Journal of Industrial Engineering | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Decomposition | en_US |
dc.subject | Examination timetabling | en_US |
dc.subject | Heuristic | en_US |
dc.subject | Industrial engineering | en_US |
dc.subject | Mixed-integer programming | en_US |
dc.subject | Optimisation | en_US |
dc.subject | Scarce resources | en_US |
dc.subject | Two stage solution strategy | en_US |
dc.subject | Heuristic programming | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Mixed integer programming | en_US |
dc.subject | Optimisations | en_US |
dc.subject | Solution strategy | en_US |
dc.subject | Integer programming | en_US |
dc.title | Examination timetabling problem with scarce resources: A case study | en_US |
dc.type | Article | en_US |
dc.identifier.volume | 12 | en_US |
dc.identifier.issue | 6 | en_US |
dc.identifier.startpage | 855 | |
dc.identifier.startpage | 855 | en_US |
dc.identifier.endpage | 874 | en_US |
dc.identifier.doi | 10.1504/EJIE.2018.096394 | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopus | 2-s2.0-85057854372 | en_US |
dc.identifier.wos | WOS:000451844600005 | en_US |
dc.identifier.scopusquality | Q2 | - |
dc.owner | Pamukkale University | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.grantfulltext | none | - |
item.languageiso639-1 | en | - |
item.openairetype | Article | - |
item.fulltext | No Fulltext | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 10.09. Industrial Engineering | - |
Appears in Collections: | Mühendislik Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
SCOPUSTM
Citations
6
checked on Dec 14, 2024
WEB OF SCIENCETM
Citations
6
checked on Dec 20, 2024
Page view(s)
38
checked on Aug 24, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.