TY - JOUR
T1 - A column generation mathematical programming approach for a class-faculty assignment problem with preferences
AU - Al-Yakoob, Salem M.
AU - Sherali, Hanif D.
N1 - Publisher Copyright:
© 2013, Springer-Verlag Berlin Heidelberg.
PY - 2013/3/20
Y1 - 2013/3/20
N2 - This paper presents a column generation approach for assigning faculty members to sections of offered classes (class-sections) in a case study related to Kuwait University. For a given class, the total number of class-sections to be offered is known; however, the distribution of these class-sections into available time-slots is determined via a mixed-integer programming model that takes into consideration faculty members’ aggregate preferences for specific offered classes and the time-slots of the corresponding sections, as well as other restrictions imposed by the Office of the Registrar. Subsequently, upon fixing the time-slot assignments of the class-sections, another mixed-integer programming model is formulated and solved to select weekly schedules for faculty members, while considering their preferences for specific classes and time-slots. In this latter model, each variable corresponds to a feasible schedule of a faculty member, and by exploiting its special structure, we demonstrate that its continuous relaxation can be solved very efficiently via a column generation method in order to heuristically derive a good quality feasible solution. Computational results are provided for a number of test instances, including 10 real cases pertaining to the Department of Mathematics at Kuwait University.
AB - This paper presents a column generation approach for assigning faculty members to sections of offered classes (class-sections) in a case study related to Kuwait University. For a given class, the total number of class-sections to be offered is known; however, the distribution of these class-sections into available time-slots is determined via a mixed-integer programming model that takes into consideration faculty members’ aggregate preferences for specific offered classes and the time-slots of the corresponding sections, as well as other restrictions imposed by the Office of the Registrar. Subsequently, upon fixing the time-slot assignments of the class-sections, another mixed-integer programming model is formulated and solved to select weekly schedules for faculty members, while considering their preferences for specific classes and time-slots. In this latter model, each variable corresponds to a feasible schedule of a faculty member, and by exploiting its special structure, we demonstrate that its continuous relaxation can be solved very efficiently via a column generation method in order to heuristically derive a good quality feasible solution. Computational results are provided for a number of test instances, including 10 real cases pertaining to the Department of Mathematics at Kuwait University.
KW - Class scheduling
KW - Column generation
KW - Mixed-integer programming
UR - http://www.scopus.com/inward/record.url?scp=84875007759&partnerID=8YFLogxK
U2 - 10.1007/s10287-013-0163-9
DO - 10.1007/s10287-013-0163-9
M3 - Article
AN - SCOPUS:84875007759
SN - 1619-697X
VL - 12
SP - 297
EP - 318
JO - Computational Management Science
JF - Computational Management Science
IS - 2
ER -