A column generation mathematical programming approach for a class-faculty assignment problem with preferences

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.

[1]  Edmund K. Burke,et al.  Decomposition, reformulation, and diving in university course timetabling , 2009, Comput. Oper. Res..

[2]  Hana Rudová,et al.  Complex university course timetabling , 2011, J. Sched..

[3]  Masood A. Badri,et al.  A two-stage multiobjective scheduling model for [faculty-course-time] assignments , 1996 .

[4]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[5]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[6]  Panagiotis Stamatopoulos,et al.  A Generic Object-Oriented Constraint-Based Model for University Course Timetabling , 2000, PATAT.

[7]  Donna F. Davis,et al.  A multi-objective course scheduling model: Combining faculty preferences for courses and times , 1998, Comput. Oper. Res..

[8]  M. A. Bakır,et al.  A 0-1 Integer Programming Approach to a University Timetabling Problem , 2008 .

[9]  Moshe Dror,et al.  A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem , 2007, J. Oper. Res. Soc..

[10]  D. Costa,et al.  A tabu search algorithm for computing an operational timetable , 1994 .

[11]  Panagiotis Miliotis,et al.  Implementation of a university course and examination timetabling system , 2001, Eur. J. Oper. Res..

[12]  Yuqiang Wang Models and Algorithms for Some Combinatorial Optimization Problems: University Course Timetabling, Facility Layout and Integrated Production-Distribution Scheduling , 2007 .

[13]  Sophia Daskalaki,et al.  Efficient solutions for a university timetabling problem through integer programming , 2005, Eur. J. Oper. Res..

[14]  A. Tripathy School Timetabling---A Case in Large Binary Integer Linear Programming , 1984 .

[15]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[16]  Igor Vasil'ev,et al.  A computational study of local search algorithms for Italian high-school timetabling , 2007, J. Heuristics.

[17]  S. A. MirHassani A computational approach to enhancing course timetabling with integer programming , 2006, Appl. Math. Comput..

[18]  Dominique de Werra,et al.  A generalized class-teacher model for some timetabling problems , 2002, Eur. J. Oper. Res..

[19]  Kuldeep Singh Sandhu,et al.  Automating Class Schedule Generation in the Context of a University Timetabling Information System , 2003 .

[20]  Andrea Schaerf,et al.  Local search techniques for large high school timetabling problems , 1999, IEEE Trans. Syst. Man Cybern. Part A.

[21]  Alain Hertz,et al.  Finding a feasible course schedule using Tabu search , 1992, Discret. Appl. Math..

[22]  Edmund K. Burke,et al.  The practice and theory of automated timetabling , 2014, Ann. Oper. Res..

[23]  Efthymios Housos,et al.  An integer programming formulation for a case study in university timetabling , 2004, Eur. J. Oper. Res..

[24]  Rafail N. Gasimov,et al.  The analytic hierarchy process and multiobjective 0-1 faculty course assignment , 2004, Eur. J. Oper. Res..

[25]  Safaai Deris,et al.  University timetabling by constraint-based reasoning: A case study , 1997 .

[26]  Rafail N. Gasimov,et al.  A multiobjective faculty-course-time slot assignment problem with preferences , 2007, Math. Comput. Model..

[27]  Igor Vasil'ev,et al.  A Computational Study of a Cutting Plane Algorithm for University Course Timetabling , 2005, J. Sched..

[28]  Efthymios Housos,et al.  A column generation approach for the timetabling problem of Greek high schools , 2003, J. Oper. Res. Soc..

[29]  Hanif D. Sherali,et al.  A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations , 2007, Eur. J. Oper. Res..

[30]  Peter J. Stuckey,et al.  New integer linear programming approaches for course timetabling , 2008, Comput. Oper. Res..

[31]  Mehrdad Tamiz,et al.  A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies , 2003, J. Oper. Res. Soc..

[32]  Hanif D. Sherali,et al.  Mathematical programming models and algorithms for a class-faculty assignment problem , 2006, Eur. J. Oper. Res..