A two-stage stochastic programming approach for a multi-objective course timetabling problem with courses cancelation risk

Abstract We study a university course timetabling problem, where the registration is implemented in two steps: pre-registration and drop/add phases. Since the ultimate timetable is finalized based on the students’ decisions made on the drop/add phase, there may be some courses need to be canceled because of not reaching to the threshold value in terms of total registered students. As a result of cancelations, some undesirable changes may be imposed on the final timetable for the students and the professors as well. In this paper, we ideally arrange course timetable, while considering the courses cancelations risk and the possible changes which may happen after the drop/add period; ultimately the undesirability is minimized in the final timetable. In order to achieve that, we optimize an objective function which consists of seven different objectives combined as a weighted sum function. As regards the solution method, we develop a two-stage stochastic programming model, a heuristic approach and a two-stage separated model where the latter one model the traditional method. The performance of all developed algorithms is then analyzed using randomly generated test instances.

[1]  Juan José Miranda Bront,et al.  An ILP based heuristic for a generalization of the post-enrollment course timetabling problem , 2016, Comput. Oper. Res..

[2]  Jonathan M. Thompson,et al.  Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem , 2015, Eur. J. Oper. Res..

[3]  Joe Henry Obit,et al.  Developing novel meta-heuristic, hyper-heuristic and cooperative search for course timetabling problems , 2010 .

[4]  Regina Berretta,et al.  A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem , 2007, 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007).

[5]  Rhyd Lewis,et al.  A survey of metaheuristic-based techniques for University Timetabling problems , 2007, OR Spectr..

[6]  Evangelos Triantaphyllou,et al.  Multi-criteria Decision Making Methods: A Comparative Study , 2000 .

[7]  Salwani Abdullah,et al.  On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems , 2012, Inf. Sci..

[8]  Sanjay Mehrotra,et al.  A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management , 2015, Oper. Res..

[9]  Barry O'Sullivan,et al.  Local search and constraint programming for the post enrolment-based course timetabling problem , 2012, Ann. Oper. Res..

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

[11]  Supachate Innet,et al.  On Improvement of Effectiveness in Automatic University Timetabling Arrangement with Applied Genetic Algorithm , 2009, 2009 Fourth International Conference on Computer Sciences and Convergence Information Technology.

[12]  Sanya Liu,et al.  An iterated local search algorithm for the University Course Timetabling Problem , 2018, Appl. Soft Comput..

[13]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[14]  Kajal De,et al.  Fuzzy Genetic Heuristic for University Course Timetable Problem , 2010 .

[15]  Sara Ceschia,et al.  Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem , 2011, Comput. Oper. Res..

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

[17]  D. de Werra,et al.  An introduction to timetabling , 1985 .

[18]  Barry McCollum,et al.  Post enrolment based course timetabling: a description ofthe problem model used for track two of the secondInternational Timetabling Competition , 2007 .

[19]  Majid Salari,et al.  Memetic and scatter search metaheuristic algorithms for a multiobjective fortnightly university course timetabling problem: a case study , 2013 .

[20]  Jaber Karimpour,et al.  A survey of approaches for university course timetabling problem , 2015, Comput. Ind. Eng..

[21]  Cor A. J. Hurkens,et al.  An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007 , 2012, Ann. Oper. Res..

[22]  Graham Kendall,et al.  Improved local search approaches to solve the post enrolment course timetabling problem , 2017, Eur. J. Oper. Res..

[23]  G. Asham Mina,et al.  Trans Genetic Coloring Approach for Timetabling Problem , 2011 .

[24]  Lotfi A. Zadeh,et al.  Fuzzy Sets , 1996, Inf. Control..

[25]  Gilbert Laporte,et al.  Recent Developments in Practical Course Timetabling , 1997, PATAT.

[26]  Gilbert Laporte,et al.  Examination Timetabling: Algorithmic Strategies and Applications , 1994 .

[27]  Paolo Toth,et al.  A new lower bound for curriculum-based course timetabling , 2013, Comput. Oper. Res..

[28]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[29]  Ramón Alvarez-Valdés,et al.  Design and implementation of a course scheduling system using Tabu Search , 2002, Eur. J. Oper. Res..