Please use this identifier to cite or link to this item: https://hdl.handle.net/11499/10471
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGüler, M.G.-
dc.contributor.authorKeskin, M.E.-
dc.contributor.authorDöyen, A.-
dc.contributor.authorAkyer, Hasan-
dc.date.accessioned2019-08-16T13:19:06Z
dc.date.available2019-08-16T13:19:06Z
dc.date.issued2015-
dc.identifier.issn0360-8352-
dc.identifier.urihttps://hdl.handle.net/11499/10471-
dc.identifier.urihttps://doi.org/10.1016/j.cie.2014.10.004-
dc.description.abstractTeaching 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.isoenen_US
dc.publisherElsevier Ltden_US
dc.relation.ispartofComputers and Industrial Engineeringen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectAnalytic hierarchy processen_US
dc.subjectGoal programmingen_US
dc.subjectHigher education planningen_US
dc.subjectMixed-integer linear programmingen_US
dc.subjectTeaching assistant-task assignment problemen_US
dc.subjectCombinatorial optimizationen_US
dc.subjectEducation computingen_US
dc.subjectInteger programmingen_US
dc.subjectMultiobjective optimizationen_US
dc.subjectStudentsen_US
dc.subjectAdministrative tasksen_US
dc.subjectAnalytic hierarchy process (ahp)en_US
dc.subjectMixed integer linear programmingen_US
dc.subjectTask assignmenten_US
dc.subjectTeaching assistantsen_US
dc.subjectUniversity educationen_US
dc.subjectEducationen_US
dc.titleOn teaching assistant-task assignment problem: A case studyen_US
dc.typeArticleen_US
dc.identifier.volume79en_US
dc.identifier.startpage18
dc.identifier.startpage18en_US
dc.identifier.endpage26en_US
dc.identifier.doi10.1016/j.cie.2014.10.004-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopus2-s2.0-84955497648en_US
dc.identifier.wosWOS:000347866900003en_US
dc.identifier.scopusqualityQ1-
dc.ownerPamukkale University-
item.openairetypeArticle-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.dept10.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
Show simple item record



CORE Recommender
Sorry the service is unavailable at the moment. Please try again later.

SCOPUSTM   
Citations

14
checked on Mar 29, 2025

WEB OF SCIENCETM
Citations

10
checked on Apr 3, 2025

Page view(s)

104
checked on Mar 4, 2025

Google ScholarTM

Check




Altmetric


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