{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T09:34:44Z","timestamp":1782380084893,"version":"3.54.5"},"reference-count":22,"publisher":"Wiley","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["5151101143"],"award-info":[{"award-number":["5151101143"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71501038"],"award-info":[{"award-number":["71501038"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["5151101143"],"award-info":[{"award-number":["5151101143"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71501038"],"award-info":[{"award-number":["71501038"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Scientific Programming"],"published-print":{"date-parts":[[2017]]},"abstract":"<jats:p>In this paper, we develop mixed-integer linear programming models for assigning the most appropriate teaching assistants to the tutorials in a department. The objective is to maximize the number of tutorials that are taught by the most suitable teaching assistants, accounting for the fact that different teaching assistants have different capabilities and each teaching assistant\u2019s teaching load cannot exceed a maximum value. Moreover, with optimization models, the teaching load allocation, a time-consuming process, does not need to be carried out in a manual manner. We have further presented a number of extensions that capture more practical considerations. Extensive numerical experiments show that the optimization models can be solved by an off-the-shelf solver and used by departments in universities.<\/jats:p>","DOI":"10.1155\/2017\/9057947","type":"journal-article","created":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T16:07:35Z","timestamp":1484150855000},"page":"1-7","source":"Crossref","is-referenced-by-count":5,"title":["Mixed-Integer Linear Programming Models for Teaching Assistant Assignment and Extensions"],"prefix":"10.1155","volume":"2017","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0973-3756","authenticated-orcid":true,"given":"Xiaobo","family":"Qu","sequence":"first","affiliation":[{"name":"School of Civil and Environmental Engineering, University of Technology Sydney, Sydney, NSW 2007, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wen","family":"Yi","sequence":"additional","affiliation":[{"name":"Department of Building and Real Estate, The Hong Kong Polytechnic University, Kowloon, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4701-9652","authenticated-orcid":true,"given":"Tingsong","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Wuhan University, Wuhan 430072, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9247-4403","authenticated-orcid":true,"given":"Shuaian","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Logistics & Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lin","family":"Xiao","sequence":"additional","affiliation":[{"name":"National Research Council of the National Research Academies of Science, Engineering, and Medicine, Washington, DC 20001, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6331-0810","authenticated-orcid":true,"given":"Zhiyuan","family":"Liu","sequence":"additional","affiliation":[{"name":"Jiangsu Key Laboratory of Urban ITS, Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies, School of Transportation, Southeast University, Jiangsu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","reference":[{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0038-0121(87)90013-9"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/0038-0121(95)98171-q"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s10734-013-9661-5"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s10734-013-9678-9"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/s0305-0548(02)00083-7"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602525"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.08.011"},{"key":"4a","doi-asserted-by":"publisher","DOI":"10.1016\/0038-0121(76)90008-2"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(87)90001-3"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00204-9"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/bf00139218"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/s10734-008-9159-8"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/s10734-011-9457-4"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1080\/03075070701685155"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1080\/03075071003759052"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1080\/1360080x.2012.642329"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1080\/1360080x.2014.957889"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)TE.1943-5436.0000461"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2016.04.005"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2015.04.005"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2014.10.009"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2014.08.008"}],"container-title":["Scientific Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2017\/9057947.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2017\/9057947.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2017\/9057947.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T16:07:39Z","timestamp":1484150859000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/sp\/2017\/9057947\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":22,"alternative-id":["9057947","9057947"],"URL":"https:\/\/doi.org\/10.1155\/2017\/9057947","relation":{},"ISSN":["1058-9244","1875-919X"],"issn-type":[{"value":"1058-9244","type":"print"},{"value":"1875-919X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}