Solving the Greek school timetabling problem by a mixed integer programming model

References

• Al-Yakoob, S. M., & Sherali, H. D. (2015). Mathematical models and algorithms for a high school timetabling problem. Computers and Operations Research, 61, 56–68. doi: 10.1016/j.cor.2015.02.011
   Web of Science ®Google Scholar
• Beligiannis, G. N., Moschopoulos, C. N., Kaperonis, G. P., & Likothanassis, S. D. (2008). Applying evolutionary computation to the school timetabling problem: The Greek case. Computers & Operations Research, 35(4), 1265–1280. doi: 10.1016/j.cor.2006.08.010
   Web of Science ®Google Scholar
• Beligiannis, G. N., Moschopoulos, C., & Likothanassis, S. D. (2009). A genetic algorithm approach to school timetabling. Journal of the Operational Research Society, 60(1), 23–42. doi: 10.1057/palgrave.jors.2602525
   Web of Science ®Google Scholar
• Birbas, T., Daskalaki, S., & Housos, E. (1997). Timetabling for Greek high schools. Journal of the Operational Research Society, 48(12), 1191–1200. doi: 10.1057/palgrave.jors.2600480
   Web of Science ®Google Scholar
• Birbas, T., Daskalaki, S., & Housos, E. (2009). School timetabling for quality student and teacher schedules. Journal of Scheduling, 12(2), 177–197. doi: 10.1007/s10951-008-0088-2
   Web of Science ®Google Scholar
• Bixby, R. E. (2012). A brief history of linear and mixed-integer programming computation. Documenta Mathematica, Extra, ISMP, 107–121.
   Google Scholar
• Carter, M. W., & Tovey, C. A. (1992). When is the classroom assignment problem hard? Operations Research, INFORMS, 40, S28–S39. doi: 10.1287/opre.40.1.S28
   Web of Science ®Google Scholar
• Cooper, T. B., & Kingston, J. H. (1996). The complexity of timetable construction problems. In E. Burke, & P. Ross (Eds.), Practice and theory of automated timetabling. PATAT 1995. Lecture notes in computer science (Vol. 1153, pp. 281–295). Berlin, Heidelberg: Springer. doi: 10.1007/3-540-61794-9_66
   Google Scholar
• Domrös, J., & Homberger, J. (2012). An evolutionary algorithm for high school timetabling. In Proceedings of the ninth international conference on the practice and theory of automated timetabling, PATAT 2012, Son, Norway, August 2012.
   Google Scholar
• Dorneles, Á. P., de Araújo, O. C., & Buriol, L. S. (2012). The impact of compactness requirements on the resolution of high school timetabling problem. CLAIO/SBPO 2012. Rio de Janeiro, Brazil.
   Google Scholar
• Dorneles, Á. P., de Araújo, O. C., & Buriol, L. S. (2014). A fix-and-optimize heuristic for the high school timetabling problem. Computers & Operations Research, 52(Part A), 29–38. doi: 10.1016/j.cor.2014.06.023
   Google Scholar
• Dorneles, Á. P., de Araújo, O. C., & Buriol, L. S. (2017). A column generation approach to high school timetabling modeled as a multicommodity flow problem. European Journal of Operational Research, 256(3), 685–695. doi: 10.1016/j.ejor.2016.07.002
   Web of Science ®Google Scholar
• Even, S., Itai, A., & Shamir, A. (1975). On the complexity of time table and multi-commodity flow problems. Foundations of Computer Science, 16th Annual Symposium on (pp. 184–193). IEEE.
   Google Scholar
• Fonseca, G. H., Santos, H. G., & Carrano, E. G. (2016). Late acceptance hill-climbing for high school timetabling. Journal of Scheduling, 19(4), 453–465. doi: 10.1007/s10951-015-0458-5
   Web of Science ®Google Scholar
• Fonseca, G. H. G., Santos, H. G., Toffolo, T. A. M., Brito, S. S., & Souza, M. J. F. (2012). A SA-ILS approach for the high school timetabling problem. In Proceedings of the ninth international conference on the practice and theory of automated timetabling, PATAT 2012, Son, Norway, August 2012.
   Google Scholar
• Katsaragakis, I. V., Tassopoulos, I. X., & Beligiannis, G. N. (2015). A comparative study of modern Heuristics on the school timetabling problem. Algorithms, 8(3), 723–742. doi: 10.3390/a8030723
   Web of Science ®Google Scholar
• Kheiri, A., Özcan, E., & Parkes, A. J. (2012). HySST: hyper-heuristic search strategies and timetabling. In Proceedings of the ninth international conference on the practice and theory of automated timetabling, PATAT 2012, Son, Norway, August 2012.
   Google Scholar
• Kingston, J. H. (2012). A software library for school timetabling. Retrieved from http://sydney.edu.au/engineering/it/∼jeff/khe/
   Google Scholar
• Kristiansen, S., & Stidsen, T. R. (2013). A Comprehensive Study of Educational Timetabling - a Survey. DTU Management Engineering Report No. 8.2013, Technical University of Denmark, Department of Management Engineering.
   Google Scholar
• Kristiansen, S., Sørensen, M., & Stidsen, T. R. (2015). Integer programming for the generalized high school timetabling problem. Journal of Scheduling, 18(4), 377–392. doi: 10.1007/s10951-014-0405-x
   Web of Science ®Google Scholar
• Lach, G., & Lübbecke, M. E. (2012). Curriculum based course timetabling: new solutions to Udine benchmark instances. Annals of Operations Research, 194(1), 255–272. doi: 10.1007/s10479-010-0700-7
   Web of Science ®Google Scholar
• Saviniec, L., & Constantino, A. A. (2017). Effective local search algorithms for high school timetabling problems. Applied Soft Computing, 60, 363–373.
   Web of Science ®Google Scholar
• Saviniec, L., Santos, M. O., & Costa, A. M. (2018). Parallel local search algorithms for high school timetabling problems. European Journal of Operational Research, 265 (1), 81–98.
   Web of Science ®Google Scholar
• Papoutsis, K., Valouxis, C., & Housos, E. (2003). A column generation approach for the timetabling problem of Greek high schools. Journal of the Operational Research Society, 54(3), 230–238. doi: 10.1057/palgrave.jors.2601495
   Web of Science ®Google Scholar
• Pillay, N. (2014). A survey of school timetabling research. Annals of Operations Research, 218(1), 261–293. doi: 10.1007/s10479-013-1321-8
   Web of Science ®Google Scholar
• Post, G., Gaspero, L. D., Kingston, J. H., McCollum, B., & Schaerf, A. (2013). The third international timetabling competition. Annals of Operational Research, 239, 69–75. doi: 10.1007/s10479-013-1340-5
   Google Scholar
• Raghavjee, R., & Pillay, N. (2013). A study of genetic algorithms to solve the school timetabling problem. In F. Castro, A. Gelbukh, and M. González (Eds.), Advances in soft computing and its applications. MICAI 2013. Lecture notes in computer science (Vol. 8266, pp. 64–80). Berlin, Heidelberg: Springer. doi: 10.1007/978-3-642-45111-9_6
   Google Scholar
• Raghavjee, R., & Pillay, N. (2015). A genetic algorithm selection perturbative hyper-heuristic for solving the school timetabling problem. ORiON, 31(1), 39–60. doi: 10.5784/31-1-158
   Google Scholar
• Santos, H. G., Uchoa, E., Ochi, L. S., & Maculan, N. (2012). Strong bounds with cut and column generation for class-teacher timetabling. Annals of Operations Research, 194(1), 399–412. doi: 10.1007/s10479-010-0709-y
   Web of Science ®Google Scholar
• Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87–127. doi: 10.1023/A:1006576209967
   Web of Science ®Google Scholar
• Skoullis, V. I., Tassopoulos, I. X., & Beligiannis, G. N. (2017). Solving the high school timetabling problem using a hybrid cat swarm optimization-based algorithm. Applied Soft Computing, 52, 277–289. doi: 10.1016/j.asoc.2016.10.038
   Web of Science ®Google Scholar
• Sørensen, M., Kristiansen, S., & Stidsen, T. R. (2012). International timetabling competition 2011: an adaptive large neighborhood search algorithm. In Proceedings of the ninth international conference on the practice and theory of automated timetabling, PATAT 2012, Son, Norway, August 2012.
   Google Scholar
• Sørensen, M., & Stidsen, T. R. (2013). Comparing Solution Approaches for a Complete Model of High School Timetabling. DTU Management Engineering Report No. 5.2013, Technical University of Denmark, Department of Management Engineering.
   Google Scholar
• Tassopoulos, I. X., & Beligiannis, G. N. (2012a). Using particle swarm optimization to solve effectively the school timetabling problem. Soft Computing, 16(7), 1229–1252. doi: 10.1007/s00500-012-0809-5
   Web of Science ®Google Scholar
• Tassopoulos, I. X., & Beligiannis, G. N. (2012b). A hybrid particle swarm optimization-based algorithm for high school timetabling problems. Applied Soft Computing, 12(11), 3472–3489. doi: 10.1016/j.asoc.2012.05.029
   Web of Science ®Google Scholar
• ten Eikelder, H. M., & Willemen, R. J. (2001). Some complexity aspects of secondary school timetabling problems. In E. Burke and W. Erben (Eds.), Practice and theory of automated timetabling III. PATAT 2000. Lecture Notes in Computer Science (Vol. 2079, pp. 18–27). Berlin, Heidelberg: Springer. doi: 10.1007/3-540-44629-X_2
   Google Scholar
• Valouxis, C., & Housos, E. (2003). Constraint programming approach for school timetabling. Computers & Operations Research, 30(10), 1555–1572. doi: 10.1016/S0305-0548(02)00083-7
   Web of Science ®Google Scholar
• Willemen, R. J. (2002). School timetable construction: Algorithms and complexity (PhD Thesis). Technische Universiteit Eindhoven, The Netherlands.
   Google Scholar
• Zhang, D., Liu, Y., M’Hallah, R., & Leung, S. C. (2010). A simulated annealing with a new neighborhood structure-based algorithm for high school timetabling problems. European Journal of Operational Research, 203(3), 550–558. doi: 10.1016/j.ejor.2009.09.014
   Web of Science ®Google Scholar