Title of article
Mixed-Integer Linear Programming Models for Teaching Assistant Assignment and Extensions
Author/Authors
Qu,Xiaobo School of Civil and Environmental Engineering - University of Technology Sydney, Sydney, Australia , Yi, Wen Department of Building and Real Estate - The Hong Kong Polytechnic University, Kowloon, Hong Kong , Wang, Tingsong School of Economics and Management - Wuhan University, China , Wang, Shuaian Department of Logistics & Maritime Studies - The Hong Kong Polytechnic University, Kowloon, Hong Kong , Xiao, Lin National Research Council of the EngNational Research Academies of Science, ineering, and Medicine, Washington, USA , Liu, Zhiyuan Jiangsu Key Laboratory of Urban ITS - Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies - School of Transportation - Southeast University, Jiangsu, China
Pages
8
From page
1
To page
8
Abstract
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’s 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.
Keywords
Mixed , Integer , Linear Programming Models , Assignment and Extensions
Journal title
Scientific Programming
Serial Year
2017
Full Text URL
Record number
2608323
Link To Document