Examination Timetabling Problem With Scarce Resources: a Case Study
| dc.contributor.author | Keskin, Muhammed Emre | |
| dc.contributor.author | Döyen, Alper | |
| dc.contributor.author | Akyer, Hasan | |
| dc.contributor.author | Güler, Mehmet Güray | |
| dc.date.accessioned | 2021-12-13T10:32:04Z | |
| dc.date.available | 2021-12-13T10:32:04Z | |
| dc.date.issued | 2018 | |
| 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. | en_US |
| dc.identifier.doi | 10.1504/EJIE.2018.096394 | |
| dc.identifier.issn | 1751-5254 | |
| dc.identifier.issn | 1751-5262 | |
| dc.identifier.scopus | 2-s2.0-85057854372 | |
| dc.identifier.uri | https://doi.org/10.1504/EJIE.2018.096394 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.13091/844 | |
| 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 | Examination Timetabling | en_US |
| dc.subject | Scarce Resources | en_US |
| dc.subject | Mixed-Integer Programming | en_US |
| dc.subject | Optimisation | en_US |
| dc.subject | Decomposition | en_US |
| dc.subject | Two Stage Solution Strategy | en_US |
| dc.subject | Heuristic | en_US |
| dc.subject | Industrial Engineering | en_US |
| dc.subject | Colony Optimization | en_US |
| dc.subject | Algorithm | en_US |
| dc.title | Examination Timetabling Problem With Scarce Resources: a Case Study | en_US |
| dc.type | Article | en_US |
| dspace.entity.type | Publication | |
| gdc.author.id | Guler, Mehmet Guray/0000-0002-9987-7616 | |
| gdc.author.scopusid | 54789689000 | |
| gdc.author.scopusid | 22978787200 | |
| gdc.author.scopusid | 57076920500 | |
| gdc.author.scopusid | 56725851300 | |
| gdc.author.wosid | Guler, Mehmet Guray/ABA-1593-2020 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C4 | |
| gdc.coar.access | metadata only access | |
| gdc.coar.type | text::journal::journal article | |
| gdc.description.department | Fakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Endüstri Mühendisliği Bölümü | en_US |
| gdc.description.endpage | 874 | en_US |
| gdc.description.issue | 6 | en_US |
| gdc.description.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q2 | |
| gdc.description.startpage | 855 | en_US |
| gdc.description.volume | 12 | en_US |
| gdc.description.wosquality | Q4 | |
| gdc.identifier.openalex | W4231273319 | |
| gdc.identifier.wos | WOS:000451844600005 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 1.0 | |
| gdc.oaire.influence | 2.7264841E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | Decomposition | |
| gdc.oaire.keywords | 330 | |
| gdc.oaire.keywords | industrial engineering | |
| gdc.oaire.keywords | Scheduling | |
| gdc.oaire.keywords | examination timetabling; scarce resources; mixed-integer programming; | |
| gdc.oaire.keywords | 610 | |
| gdc.oaire.keywords | Heuristic | |
| gdc.oaire.keywords | Mixed-integer programming | |
| gdc.oaire.keywords | Integer programming | |
| gdc.oaire.keywords | Examination timetabling | |
| gdc.oaire.keywords | Two stage solution strategy | |
| gdc.oaire.keywords | Heuristic programming | |
| gdc.oaire.keywords | Industrial engineering | |
| gdc.oaire.keywords | optimisation; decomposition; two stage solution strategy; heuristic; | |
| gdc.oaire.keywords | Solution strategy | |
| gdc.oaire.keywords | Scarce resources | |
| gdc.oaire.keywords | Mixed integer programming | |
| gdc.oaire.keywords | Optimisation | |
| gdc.oaire.keywords | Optimisations | |
| gdc.oaire.popularity | 4.303041E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0211 other engineering and technologies | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.oaire.sciencefields | 0202 electrical engineering, electronic engineering, information engineering | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 0.44289464 | |
| gdc.openalex.normalizedpercentile | 0.72 | |
| gdc.opencitations.count | 4 | |
| gdc.plumx.mendeley | 6 | |
| gdc.plumx.scopuscites | 7 | |
| gdc.scopus.citedcount | 7 | |
| gdc.virtual.author | Döyen, Alper | |
| gdc.wos.citedcount | 8 | |
| relation.isAuthorOfPublication | 26d7113b-b72a-445f-ac68-46ba190bbd47 | |
| relation.isAuthorOfPublication.latestForDiscovery | 26d7113b-b72a-445f-ac68-46ba190bbd47 |
