Please use this identifier to cite or link to this item:
https://hdl.handle.net/11499/10471
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Güler, M.G. | - |
dc.contributor.author | Keskin, M.E. | - |
dc.contributor.author | Döyen, A. | - |
dc.contributor.author | Akyer, Hasan | - |
dc.date.accessioned | 2019-08-16T13:19:06Z | |
dc.date.available | 2019-08-16T13:19:06Z | |
dc.date.issued | 2015 | - |
dc.identifier.issn | 0360-8352 | - |
dc.identifier.uri | https://hdl.handle.net/11499/10471 | - |
dc.identifier.uri | https://doi.org/10.1016/j.cie.2014.10.004 | - |
dc.description.abstract | Teaching assistants (TAs), together with the senior academic staff, are the centerpiece of university education. TAs are primarily graduate students and they undertake many of the academic and administrative tasks. These tasks are assigned at the beginning of each semester and the objective is to make fair assignments so that the loads are distributed evenly in accordance with requests of the professors and assistants. In this study, a goal programming (GP) model is developed for task assignment of the TAs in an industrial engineering department. While the rules that must be strictly met (e.g., assigning every task to an assistant) are formulated as hard constraints, fair distribution of the loads are modeled as soft constraints. Penalties for deviation from the soft constraints are determined by the Analytic Hierarchy Process (AHP). The proposed GP model avoids assigning the same TA to the same task in several consecutive academic years, i.e., sticking of a task to a TA. We show that the proposed formulation generates better schedules than the previously used ad hoc method with a much less effort. © 2014 Elsevier Ltd. All rights reserved. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Elsevier Ltd | en_US |
dc.relation.ispartof | Computers and Industrial Engineering | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Analytic hierarchy process | en_US |
dc.subject | Goal programming | en_US |
dc.subject | Higher education planning | en_US |
dc.subject | Mixed-integer linear programming | en_US |
dc.subject | Teaching assistant-task assignment problem | en_US |
dc.subject | Combinatorial optimization | en_US |
dc.subject | Education computing | en_US |
dc.subject | Integer programming | en_US |
dc.subject | Multiobjective optimization | en_US |
dc.subject | Students | en_US |
dc.subject | Administrative tasks | en_US |
dc.subject | Analytic hierarchy process (ahp) | en_US |
dc.subject | Mixed integer linear programming | en_US |
dc.subject | Task assignment | en_US |
dc.subject | Teaching assistants | en_US |
dc.subject | University education | en_US |
dc.subject | Education | en_US |
dc.title | On teaching assistant-task assignment problem: A case study | en_US |
dc.type | Article | en_US |
dc.identifier.volume | 79 | en_US |
dc.identifier.startpage | 18 | |
dc.identifier.startpage | 18 | en_US |
dc.identifier.endpage | 26 | en_US |
dc.identifier.doi | 10.1016/j.cie.2014.10.004 | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopus | 2-s2.0-84955497648 | en_US |
dc.identifier.wos | WOS:000347866900003 | en_US |
dc.identifier.scopusquality | Q1 | - |
dc.owner | Pamukkale University | - |
item.openairetype | Article | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
item.languageiso639-1 | en | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
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
Sorry the service is unavailable at the moment. Please try again later.
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.