On teaching assistant-task assignment problem: A case study

•We address the problem of assigning teaching assistants to the courses.•Our model focuses mainly on the preferences of the assistants.•Problems of realistic sizes can be solved in a reasonable amount of time.•The model can easily be adapted for the usage of other departments. Teaching assistants (T...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & industrial engineering Ročník 79; s. 18 - 26
Hlavní autoři:	Güler, M. Güray, Keskin, M. Emre, Döyen, Alper, Akyer, Hasan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.01.2015 Pergamon Press Inc
Témata:	Analytic hierarchy process Assignment problem Decision analysis Deviation Distribution Education Goal programming Graduates Higher education planning Industrial engineering Mathematical models Mixed-integer linear programming Stress concentration Studies Tasks Teaching Teaching assistant-task assignment problem Teaching assistants Higher education planning Teaching assistant-task assignment problem Mixed-integer linear programming Analytic hierarchy process Goal programming
ISSN:	0360-8352, 1879-0550
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	•We address the problem of assigning teaching assistants to the courses.•Our model focuses mainly on the preferences of the assistants.•Problems of realistic sizes can be solved in a reasonable amount of time.•The model can easily be adapted for the usage of other departments. 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.
AbstractList	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. •We address the problem of assigning teaching assistants to the courses.•Our model focuses mainly on the preferences of the assistants.•Problems of realistic sizes can be solved in a reasonable amount of time.•The model can easily be adapted for the usage of other departments. 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.
Author	Akyer, Hasan Güler, M. Güray Döyen, Alper Keskin, M. Emre
Author_xml	– sequence: 1 givenname: M. Güray surname: Güler fullname: Güler, M. Güray email: guler@boun.edu.tr organization: Lojika Bilgi Teknolojileri, Levent, Istanbul, Turkey – sequence: 2 givenname: M. Emre surname: Keskin fullname: Keskin, M. Emre organization: Dept. of Industrial Engineering, Atatürk University, Erzurum, Turkey – sequence: 3 givenname: Alper surname: Döyen fullname: Döyen, Alper organization: Dept. of Industrial Engineering, Selçuk University, Konya, Turkey – sequence: 4 givenname: Hasan surname: Akyer fullname: Akyer, Hasan organization: Dept. of Industrial Engineering, Pamukkale University, Denizli, Turkey
BookMark	eNp9kE1LAzEQhoMoWD9-gLcFL162TpLNx-pJxC8QetFzSLOzNXWb1SQV-u9NrScPnoZ3eJ5heI_IfhgDEnJGYUqBysvl1HmcMqBNyVOAZo9MqFZtDULAPpkAl1BrLtghOUppCYUQLZ2Q61moMlr35sOisin5lG3Idbbp_ScuwgpDrj7iOB9wdVXdVM4mrFJed5sTctDbIeHp7zwmr_d3L7eP9fPs4en25rl2XOhczxnvHLdWKCk67SRVqukb2gnNJEDHFbbA5krztqeSWdlir61lomNMcweKH5OL3d3yxecaUzYrnxwOgw04rpOhstzRwFhb0PM_6HJcx1C-KxRXsqGMQ6HUjnJxTClib5zPNvsx5Gj9YCiYbalmWfZotqVuV6WyYtI_5kf0Kxs3_zrXOwdLR18eo0kFCQ47H9Fl043-H_sbWAGOsA
CODEN	CINDDL
CitedBy_id	crossref_primary_10_1016_j_ijpe_2017_12_010 crossref_primary_10_1016_j_cie_2019_03_048 crossref_primary_10_1016_j_eswa_2021_115967 crossref_primary_10_1287_ited_2024_0095 crossref_primary_10_1007_s12351_016_0247_8 crossref_primary_10_1080_23311916_2018_1466382 crossref_primary_10_1080_01605682_2017_1415645
Cites_doi	10.1016/0305-0548(87)90001-3 10.1016/j.eswa.2010.06.051 10.1287/mnsc.22.12.1332 10.1016/0377-2217(95)00204-9 10.1016/S0377-2217(03)00189-9 10.1016/S0377-2217(03)00103-6 10.1016/0377-2217(90)90057-I 10.1287/opre.37.6.853 10.1016/S0305-0548(97)00048-8 10.1016/j.eswa.2011.12.013 10.1016/j.mcm.2007.03.012 10.1016/S0957-4174(02)00017-9 10.1016/S0957-4174(03)00004-6
ContentType	Journal Article
Copyright	2014 Elsevier Ltd Copyright Pergamon Press Inc. Jan 2015
Copyright_xml	– notice: 2014 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Jan 2015
DBID	AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/j.cie.2014.10.004
DatabaseName	CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Applied Sciences Engineering Education
EISSN	1879-0550
EndPage	26
ExternalDocumentID	3530585191 10_1016_j_cie_2014_10_004 S0360835214003350
Genre	Feature
GroupedDBID	--K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKG AABNK AACTN AAEDT AAEDW AAFWJ AAIKC AAIKJ AAKOC AALRI AAMNW AAOAW AAQFI AAQXK AARIN AATTM AAXKI AAXUO ABAOU ABDPE ABJNI ABMAC ABUCO ABWVN ABXDB ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACRPL ADBBV ADEZE ADGUI ADMUD ADNMO ADRHT ADTZH AEBSH AECPX AEIPS AEKER AENEX AFJKZ AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AIEXJ AIGVJ AIKHN AITUG AKRWK ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BKOMP BLXMC BNPGV CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LX9 LY1 LY7 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SDP SDS SES SET SEW SPC SPCBC SSB SSD SSH SST SSW SSZ T5K TAE TN5 WUQ XPP ZMT ~G- 9DU AAYWO AAYXX ACLOT ACVFH ADCNI AEUPX AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP APXCP CITATION EFKBS EFLBG ~HD 7SC 8FD AFXIZ AGCQF AGRNS JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c358t-b23dc3aa5765d8c61774f41d582600d37e902b7839f162a69ef8aa25d2283c073
ISICitedReferencesCount	11
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000347866900003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0360-8352
IngestDate	Sat Sep 27 19:18:17 EDT 2025 Sun Jul 13 05:35:08 EDT 2025 Tue Nov 18 22:38:40 EST 2025 Sat Nov 29 01:39:47 EST 2025 Sun Apr 06 06:54:01 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Keywords	Higher education planning Teaching assistant-task assignment problem Mixed-integer linear programming Analytic hierarchy process Goal programming
Language	English
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c358t-b23dc3aa5765d8c61774f41d582600d37e902b7839f162a69ef8aa25d2283c073
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
PQID	1637641230
PQPubID	9545
PageCount	9
ParticipantIDs	proquest_miscellaneous_1660080229 proquest_journals_1637641230 crossref_citationtrail_10_1016_j_cie_2014_10_004 crossref_primary_10_1016_j_cie_2014_10_004 elsevier_sciencedirect_doi_10_1016_j_cie_2014_10_004
PublicationCentury	2000
PublicationDate	January 2015 2015-01-00 20150101
PublicationDateYYYYMMDD	2015-01-01
PublicationDate_xml	– month: 01 year: 2015 text: January 2015
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Computers & industrial engineering
PublicationYear	2015
Publisher	Elsevier Ltd Pergamon Press Inc
Publisher_xml	– name: Elsevier Ltd – name: Pergamon Press Inc
References	Schniederjans, Kim (b0075) 1987; 14 Wang (b0095) 2003; 25 Ismayilova, Sağir, Gasimov (b0055) 2007; 46 Wang (b0090) 2002; 22 Badri (b0010) 1996; 94 Badri, Davis, Davis, Hollingsworth (b0015) 1998; 25 pp. 81–101. Dinkel, Mote, Venkataramanan (b0025) 1989; 37 Özdemir, Gasimov (b0065) 2004; 157 Daskalaki, Birbas, Housos (b0020) 2004; 153 . Lim, R., Guddeti, V.P. and Choueiry, B.Y. (2004) An interactive system for hiring and managing graduate teaching assistants, Vol. 16. ECAI, Citeseer, p. 730. Saaty (b0070) 1990; 48 Shiau (b0080) 2011; 38 European Conference on Artificial Intelligence, ECAI 2002. Gunawan, Ng, Ong (b0045) 2008; 19 Tassopoulos, Beligiannis (b0085) 2012; 39 Gaubius, R. & Choueiry, B. (2002). Constraint modeling and reformulation in the context of academic task assignment. Al-Husain, Hasan, Al-Qaheri (b0005) 2011; 35 Dyer, Mulvey (b0030) 1976; 22 Gunawan, Ng (b0040) 2011; 22 Gurobi Optimization, I. (2012). Gurobi optimizer reference manual. URL Zou, H. & Choueiry, B.Y. (2003). Characterizing the behavior of a multi-agent search by using it to solve a tight, real-world resource allocation problem. Badri (10.1016/j.cie.2014.10.004_b0015) 1998; 25 Badri (10.1016/j.cie.2014.10.004_b0010) 1996; 94 Daskalaki (10.1016/j.cie.2014.10.004_b0020) 2004; 153 Gunawan (10.1016/j.cie.2014.10.004_b0045) 2008; 19 Özdemir (10.1016/j.cie.2014.10.004_b0065) 2004; 157 Tassopoulos (10.1016/j.cie.2014.10.004_b0085) 2012; 39 Al-Husain (10.1016/j.cie.2014.10.004_b0005) 2011; 35 Wang (10.1016/j.cie.2014.10.004_b0095) 2003; 25 Dyer (10.1016/j.cie.2014.10.004_b0030) 1976; 22 Gunawan (10.1016/j.cie.2014.10.004_b0040) 2011; 22 Ismayilova (10.1016/j.cie.2014.10.004_b0055) 2007; 46 Schniederjans (10.1016/j.cie.2014.10.004_b0075) 1987; 14 10.1016/j.cie.2014.10.004_b0100 10.1016/j.cie.2014.10.004_b0050 Shiau (10.1016/j.cie.2014.10.004_b0080) 2011; 38 10.1016/j.cie.2014.10.004_b0060 Dinkel (10.1016/j.cie.2014.10.004_b0025) 1989; 37 Saaty (10.1016/j.cie.2014.10.004_b0070) 1990; 48 Wang (10.1016/j.cie.2014.10.004_b0090) 2002; 22 10.1016/j.cie.2014.10.004_b0035
References_xml	– volume: 25 start-page: 303 year: 1998 end-page: 316 ident: b0015 article-title: A multi-objective course scheduling model: Combining faculty preferences for courses and times publication-title: Computers & Operations Research – reference: Zou, H. & Choueiry, B.Y. (2003). Characterizing the behavior of a multi-agent search by using it to solve a tight, real-world resource allocation problem. – volume: 37 start-page: 853 year: 1989 end-page: 864 ident: b0025 article-title: Or practice—An efficient decision support system for academic course scheduling publication-title: Operations Research – volume: 22 start-page: 295 year: 2002 end-page: 302 ident: b0090 article-title: An application of genetic algorithm methods for teacher assignment problems publication-title: Expert Systems with Applications – volume: 14 start-page: 87 year: 1987 end-page: 96 ident: b0075 article-title: A goal programming model to optimize departmental preference in course assignments publication-title: Computers & Operations Research – volume: 19 start-page: 1 year: 2008 end-page: 16 ident: b0045 article-title: A genetic algorithm for the teacher assignment problem for a university in Indonesia publication-title: Information and Management Sciences – reference: Lim, R., Guddeti, V.P. and Choueiry, B.Y. (2004) An interactive system for hiring and managing graduate teaching assistants, Vol. 16. ECAI, Citeseer, p. 730. – reference: Gurobi Optimization, I. (2012). Gurobi optimizer reference manual. URL: – volume: 35 start-page: 157 year: 2011 end-page: 164 ident: b0005 article-title: A sequential three-stage integer goal programming (IGP) model for faculty–course–time–classroom assignments publication-title: Informatica: An International Journal of Computing and Informatics – volume: 22 start-page: 73 year: 2011 end-page: 86 ident: b0040 article-title: Solving the teacher assignment problem by two metaheuristics publication-title: International Journal of Information and Management Sciences – volume: 94 start-page: 16 year: 1996 end-page: 28 ident: b0010 article-title: A two-stage multiobjective scheduling model for [faculty–course–time] assignments publication-title: European Journal of Operational Research – reference: . European Conference on Artificial Intelligence, ECAI 2002. – reference: . – volume: 22 start-page: 1332 year: 1976 end-page: 1341 ident: b0030 article-title: An integrated optimization/information system for academic departmental planning publication-title: Management Science – volume: 38 start-page: 235 year: 2011 end-page: 248 ident: b0080 article-title: A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences publication-title: Expert Systems with Applications – volume: 48 start-page: 9 year: 1990 end-page: 26 ident: b0070 article-title: How to make a decision: Analytic hierarchy process publication-title: European Journal of Operational Research – volume: 25 start-page: 39 year: 2003 end-page: 50 ident: b0095 article-title: Using genetic algorithm methods to solve course scheduling problems publication-title: Expert Systems with Applications – reference: Gaubius, R. & Choueiry, B. (2002). Constraint modeling and reformulation in the context of academic task assignment. – volume: 153 start-page: 117 year: 2004 end-page: 135 ident: b0020 article-title: An integer programming formulation for a case study in university timetabling publication-title: European Journal of Operational Research – volume: 46 start-page: 1017 year: 2007 end-page: 1029 ident: b0055 article-title: A multiobjective faculty–course–time slot assignment problem with preferences publication-title: Mathematical and Computer Modelling – volume: 157 start-page: 398 year: 2004 end-page: 408 ident: b0065 article-title: The analytic hierarchy process and multiobjective 0–1 faculty course assignment publication-title: European Journal of Operational Research – volume: 39 start-page: 6029 year: 2012 end-page: 6040 ident: b0085 article-title: Solving effectively the school timetabling problem using particle swarm optimization publication-title: Expert Systems with Applications – reference: , pp. 81–101. – volume: 14 start-page: 87 issue: 2 year: 1987 ident: 10.1016/j.cie.2014.10.004_b0075 article-title: A goal programming model to optimize departmental preference in course assignments publication-title: Computers & Operations Research doi: 10.1016/0305-0548(87)90001-3 – volume: 38 start-page: 235 issue: 1 year: 2011 ident: 10.1016/j.cie.2014.10.004_b0080 article-title: A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2010.06.051 – volume: 22 start-page: 1332 issue: 12 year: 1976 ident: 10.1016/j.cie.2014.10.004_b0030 article-title: An integrated optimization/information system for academic departmental planning publication-title: Management Science doi: 10.1287/mnsc.22.12.1332 – volume: 94 start-page: 16 issue: 1 year: 1996 ident: 10.1016/j.cie.2014.10.004_b0010 article-title: A two-stage multiobjective scheduling model for [faculty–course–time] assignments publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00204-9 – volume: 22 start-page: 73 year: 2011 ident: 10.1016/j.cie.2014.10.004_b0040 article-title: Solving the teacher assignment problem by two metaheuristics publication-title: International Journal of Information and Management Sciences – volume: 157 start-page: 398 issue: 2 year: 2004 ident: 10.1016/j.cie.2014.10.004_b0065 article-title: The analytic hierarchy process and multiobjective 0–1 faculty course assignment publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(03)00189-9 – ident: 10.1016/j.cie.2014.10.004_b0100 – ident: 10.1016/j.cie.2014.10.004_b0050 – volume: 153 start-page: 117 issue: 1 year: 2004 ident: 10.1016/j.cie.2014.10.004_b0020 article-title: An integer programming formulation for a case study in university timetabling publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(03)00103-6 – volume: 48 start-page: 9 year: 1990 ident: 10.1016/j.cie.2014.10.004_b0070 article-title: How to make a decision: Analytic hierarchy process publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(90)90057-I – volume: 37 start-page: 853 issue: 6 year: 1989 ident: 10.1016/j.cie.2014.10.004_b0025 article-title: Or practice—An efficient decision support system for academic course scheduling publication-title: Operations Research doi: 10.1287/opre.37.6.853 – ident: 10.1016/j.cie.2014.10.004_b0035 – ident: 10.1016/j.cie.2014.10.004_b0060 – volume: 35 start-page: 157 issue: 2 year: 2011 ident: 10.1016/j.cie.2014.10.004_b0005 article-title: A sequential three-stage integer goal programming (IGP) model for faculty–course–time–classroom assignments publication-title: Informatica: An International Journal of Computing and Informatics – volume: 25 start-page: 303 issue: 4 year: 1998 ident: 10.1016/j.cie.2014.10.004_b0015 article-title: A multi-objective course scheduling model: Combining faculty preferences for courses and times publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(97)00048-8 – volume: 39 start-page: 6029 issue: 5 year: 2012 ident: 10.1016/j.cie.2014.10.004_b0085 article-title: Solving effectively the school timetabling problem using particle swarm optimization publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2011.12.013 – volume: 19 start-page: 1 issue: 1 year: 2008 ident: 10.1016/j.cie.2014.10.004_b0045 article-title: A genetic algorithm for the teacher assignment problem for a university in Indonesia publication-title: Information and Management Sciences – volume: 46 start-page: 1017 issue: 7 year: 2007 ident: 10.1016/j.cie.2014.10.004_b0055 article-title: A multiobjective faculty–course–time slot assignment problem with preferences publication-title: Mathematical and Computer Modelling doi: 10.1016/j.mcm.2007.03.012 – volume: 22 start-page: 295 issue: 4 year: 2002 ident: 10.1016/j.cie.2014.10.004_b0090 article-title: An application of genetic algorithm methods for teacher assignment problems publication-title: Expert Systems with Applications doi: 10.1016/S0957-4174(02)00017-9 – volume: 25 start-page: 39 issue: 1 year: 2003 ident: 10.1016/j.cie.2014.10.004_b0095 article-title: Using genetic algorithm methods to solve course scheduling problems publication-title: Expert Systems with Applications doi: 10.1016/S0957-4174(03)00004-6
SSID	ssj0004591
Score	2.1715145
Snippet	•We address the problem of assigning teaching assistants to the courses.•Our model focuses mainly on the preferences of the assistants.•Problems of realistic... Teaching assistants (TAs), together with the senior academic staff, are the centerpiece of university education. TAs are primarily graduate students and they...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	18
SubjectTerms	Analytic hierarchy process Assignment problem Decision analysis Deviation Distribution Education Goal programming Graduates Higher education planning Industrial engineering Mathematical models Mixed-integer linear programming Stress concentration Studies Tasks Teaching Teaching assistant-task assignment problem Teaching assistants
Title	On teaching assistant-task assignment problem: A case study
URI	https://dx.doi.org/10.1016/j.cie.2014.10.004 https://www.proquest.com/docview/1637641230 https://www.proquest.com/docview/1660080229
Volume	79
WOSCitedRecordID	wos000347866900003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-0550 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004591 issn: 0360-8352 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLfKxgEOfAwQhYGCxC5UmdIkjmM4ha3VgK7doZN6ixzbmbaVrDTZtP1N_JM8x3bTFlHBgUtUO46V-r2897PfF0LvVXg1xz7sVDnHbih47LJQSGhmWcR4zAWvs-sPyHAYTyb0pNX6aWNhbqakKOLbWzr7r6SGPiC2Cp39B3IvJoUO-A1EhyuQHa5_RfhR0amsiyQgY4UPi8qtWHlZN8-0-d8UktGB6RxU2VKiWZu4wBR8KGv2OG9qfMgmh-HCfUcZ3D8fmLDC445pzxsXnW-yNJW_jju9743L7WE9MrrT4i-Zzhp34eTyTs93xKzrkDmf6OK184kTOT9TdZO0S8mqdydoT89VEFArIy2BY0JdD-tstFZE63ozRsZqef2b6NenEBf7IBKVx164XzvthY2es7b94Sjtnw4G6bg3Ga_e1WodgwgEHEq7e0F_9sNVBcqUIX8vONTMcg9t-wRTEKHbyZfe5OtScnpdoNH-K2tEr90J117rTzBoDRDUKGf8BD0y2xMn0Wz1FLVksYMem62KYxRBuYMeLuWxfIY-jQrH8pyzynNOw3OO4bmPTuIojnNqjnuOTvu98cGRa6pyuDzAceVmfiB4wBhsVLGIOSBgEuZhV-BY1ToQAZHU8zMCwDvvRj6LqMxjxnwsVKIlDhrlBdoqrgr5Ejk0o4RxIniYw-IRyoQfBUFOIi_HWcDiNvLsIqXcpKxXlVOmqfVNvIB-map1VV2wrm30YfHITOdr2TQ4tCufGsCpgWQKTLXpsV1LpdR8-GUK-xoShYADvTZ6t7gNsloZ4Fghr67VmEjHttNXm6d4jR40n9Iu2qrm1_INus9vqvNy_tbw3S94Oa6h
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+teaching+assistant-task+assignment+problem%3A+A+case+study&rft.jtitle=Computers+%26+industrial+engineering&rft.au=G%C3%BCler%2C+M+G%C3%BCray&rft.au=Keskin%2C+M+Emre&rft.au=D%C3%B6yen%2C+Alper&rft.au=Akyer%2C+Hasan&rft.date=2015-01-01&rft.pub=Pergamon+Press+Inc&rft.issn=0360-8352&rft.eissn=1879-0550&rft.volume=79&rft.spage=18&rft_id=info:doi/10.1016%2Fj.cie.2014.10.004&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3530585191
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0360-8352&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0360-8352&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0360-8352&client=summon