Abstract
This paper explores mathematical programming models for an exam timetabling problem related to Kuwait University (KU). In particular, we consider two subproblems: (a) the ExamTimetabling Problem (ETP), which is concerned with assigning exams to designated exam-periods and classrooms, and (b) the Proctor Assignment Problem (PAP), which deals with the assignment of proctors to exams. While this exam timetabling problem is ubiquitous in many academic institutions worldwide, idiosyncrasies of the problem related to gender-based policies and having multiple exam centers at KU require novel models. A mixed-integer exam timetabling programming model (ETM) is developed for ETP, which takes into account restrictions related to exam-period conflicts, facility and human resources, and commuting and traffic considerations. Assuming that exam-periods are specified for all exams as determined by ETM, another mixed-integer programming model is formulated for PAP, denoted by PAM, which incorporates the proctors’ preferences for specific days and exam-periods. Computational results are reported and analyzed for solving ETM and PAM directly using the CPLEX Optimization Software (version 9.0), and for implementing a specialized sequential LP-based heuristic for solving PAM. The results obtained significantly improve upon those derived via the existing manual approach implemented at KU, in terms of eliminating conflicts as well as from the overall efficiency and equity points of view.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Al-Jazzaf M (2006) A mixed-integer mathematical modeling approach to exam timetabling at Kuwait University. Master’s Thesis, Department of Mathematics and Computer Science, Kuwait University
Al-Yakoob SM and Sherali HD (2006a). Mathematical programming models and algorithms for a class-faculty assignment problem. Eur J Oper Res 173: 488–507
Al-Yakoob SM, Sherali HD (2006b) A column generation approach for an employee scheduling problem with multiple shifts and work locations. J Oper Res Soc 1–10
Beaumont N (1997a). Scheduling staff using mixed integer programming. Eur J Oper Res 98: 473–484
Beaumont N (1997b). Using mixed-integer programming to design employee rosters. J Oper Res Soc 48: 585–590
Birbas T, Daskalaki S and Housos E (1997). Timetabling for greek high schools. J Oper Res Soc 48: 1191–1200
Burke EK, Bykov Y and Petrovic S (2001). A multicriteria approach to examination timetabling. In: Burke, E and Erban, W (eds) Practice and theory of automated timetabling III, (LNCS 2079), pp 104–117. Springer, Berlin,
Burke EK, Elliman DG, Ford PH and Weare RF (1996). Examination timetabling in British universities: a survey. In: Burke, E and Ross, P (eds) Practice and theory of automated timetabling I, (LNCS 1153), pp 76–90. Springer, Berlin
Burke EK and Petrovic S (2002). Recent research directions in automated timetabling. Eur J Oper Res 140: 266–280
Carter MW and Laporte G (1996). Recent developments in practical examination timetabling. In: Burke, E and Ross, P (eds) Practice and theory of automated timetabling I, (LNCS 1153), pp 3–21. Springer, Berlin
Cheng E, Kruk S and Lipman M (2003). Flow formulations for the student scheduling problem. In: Burke, E and De Causmaecker, P (eds) Practice and theory of automated timetabling IV, (LNCS 2740), pp 299–309. Springer, Berlin
Daskalaki S and Birbas T (2005). Efficient solutions for a university timetabling problem through integer programming. Eur J Oper Res 160: 106–120
Daskalaki S, Birbas T and Housos E (2004). An integer programming formulation for a case study in university timetabling. Eur J Oper Res 153: 117–135
ILOG Inc. (2004) CPLEX optimization solver reference manual
Meisels A, Gudes E and Solotorevsky G (1996). Employee timetabling, constraint networks and knowledge-based rules: a mixed approach. In: Burke, E and Ross, P (eds) Practice and theory of automated timetabling I, (LNCS 1153), pp 93–105. Springer, Berlin
Meisels A and Kaplansky E (2003). Scheduling agents-distributed timetabling problems. In: Burke, E and De Causmaecker, P (eds) Practice and theory of automated timetabling IV, (LNCS 2740), pp 166–177. Springer, Berlin
Meisels A and Kaplansky E (2004). Iterative restart technique for solving timetabling problems. Eur J Oper Res 153: 41–50
Mirrazavi SK, Mardle SJ and Tamiz M (2003). A two-phase multiple objective approach to university timetabling utilizing optimization and evolutionary solution methodologies. J Oper Res Soc 54: 1155–1166
Mukherjee AK and Gilbert KC (1997). Lagrangian heuristics for instructor scheduling in executive development programmes. J Oper Res Soc 48: 373–382
Mullinax C and Lawley M (2002). Assigning patients to nurses in neonatal intensive care. J Oper Res Soc 53: 25–35
Sandhu KS (2001) Automating class schedule generation in the context of a university timetabling information system, Phd dissertation, School of Management, Nathan Campus, Griffith University
Schaerf A (1999). A survey of automated timetabling. Artif Intell Rev 13: 87–127
Sherali HD and Smith JC (2001). Improving discrete model representations via symmetry considerations. Manage Sci 47(10): 1396–1407
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Al-Yakoob, S.M., Sherali, H.D. & Al-Jazzaf, M. A mixed-integer mathematical modeling approach to exam timetabling. Comput Manag Sci 7, 19–46 (2010). https://doi.org/10.1007/s10287-007-0066-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10287-007-0066-8