Near-Optimal Course Scheduling at the Technion

References

• Abdennadher S, Marte M (2000) University course timetabling using constraint handling rules. Appl. Artificial Intelligence 14(4):311–325.Crossref, Google Scholar
• Achá RJA, Nieuwenhuis R (2014) Curriculum-based course timetabling with SAT and MaxSAT. Ann. Oper. Res. 218(1):71–91.Crossref, Google Scholar
• Audemard G, Simon L (2009) Predicting learnt clauses quality in modern SAT solvers. Boutilier C, ed. Proc. 21st Internat. Joint Conf. Artificial Intelligence, Pasadena, CA, 399–404.Google Scholar
• Biere A (2014) Yet another local search solver and lingeling and friends entering the SAT competition 2014. Accessed May 10, 2017, http://fmv.jku.at/papers/Biere-SAT-Competition-2014.pdf.Google Scholar
• Chin-A-Fat KK (2004) School timetabling using satisfiability solvers. Master’s thesis, Delft University of Technology, Delft, Netherlands.Google Scholar
• de Moura LM, Bjørner N (2008) Z3: An efficient SMT solver. Ramakrishnan CR, Rehof J, eds. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science, Vol. 4963 (Springer-Verlag, Berlin), 337–340.Crossref, Google Scholar
• De-Werra D (1985) An introduction to timetabling. Eur. J. Oper. Res. 19(2):151–162.Crossref, Google Scholar
• Eén N, Sörensson N (2006) Translating pseudo-Boolean constraints into SAT. JSAT 2(1–4):1–26.Google Scholar
• Gaspero L, McCollum B, Schaerf A (2007) The Second International Timetabling Competition (ITC): Curriculum-based course timetabling. Accessed May 10, 2017, http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.211.3344&rep=rep1&type=pdf.Google Scholar
• Gershman R, Strichman O (2009) HaifaSat: A SAT solver based on an abstraction/refinement model. J. Satisfiability Boolean Model. Comput. 6(1–3):33–51.Google Scholar
• Guéret C, Jussien N, Boizumault P, Prins C (1996) Building university timetables using constraint logic programming. Burke E, Ross P, eds. Practice and Theory of Automated Timetabling. PATAT 1995, Lecture Notes in Computer Science, Vol. 1153 (Springer, Berlin), 130–145.Crossref, Google Scholar
• Harwood GB, Lawless RW (1975) Optimizing organizational goals in assigning faculty teaching schedules. Decision Sci. 6(3):513–524.Crossref, Google Scholar
• Heras F, Morgado A, Marques-Silva J (2015) MaxSAT-based encodings for group MaxSAT. J. AI Commun. 28(2):195–214.Google Scholar
• Hinkin TR, Thompson GM (2002) SchedulExpert: Scheduling courses in the Cornell University School of Hotel Administration. Interfaces 32(6):45–57.Link, Google Scholar
• IBM (2014) CPLEX optimizer. Accessed August 14, 2017, https://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/.Google Scholar
• Kassa BA (2015) Implementing a class-scheduling system at the College of Business and Economics of Bahir Dar University, Ethiopia. Interfaces 45(3):203–215.Link, Google Scholar
• Kroening D, Strichman O (2008) Decision Procedures—An Algorithmic Point of View (Springer-Verlag, Berlin).Google Scholar
• Liffiton MH, Sakallah KA (2008) Algorithms for computing minimal unsatisfiable subsets of constraints. J. Automated Reasoning 40(1):1–33.Crossref, Google Scholar
• Miranda J, Rey PA, Robles JM (2012) Udpskeduler: A Web architecture based decision support system for course and classroom scheduling. Decision Support Systems 52(2):505–513.Crossref, Google Scholar
• Morgado A, Heras F, Marques-Silva J (2012) Improvements to core-guided binary search for MaxSAT. Cimatti A, Sebastiani R, eds. Theory and Applications of Satisfiability Testing—SAT, Lecture Notes in Computer Science, Vol. 7317 (Springer-Verlag, Berlin), 284–297.Crossref, Google Scholar
• Nethercote N, Stuckey PJ, Becket R, Brand S, Duck GJ, Tack G (2007) MiniZinc: Towards a standard CP modelling language. Accessed August 14, 2017, https://www.comp.nus.edu.sg/~gregory/papers/cp07.pdf.Google Scholar
• Özcan E, Burke EK, McCollum B, Kjenstad D, Riise A (2016) The practice and theory of automated timetabling (2012). Ann. Oper. Res. 218(1):1–2.Crossref, Google Scholar
• Petke J, Jeavons P (2011) The order encoding: From tractable CSP to tractable SAT. Sakallah KA, Simon L, eds. Theory and Applications of Satisfiability Testing—SAT 2011 (Springer, Berlin), 371–372.Crossref, Google Scholar
• Rudová H, Murray KS (2002) University course timetabling with soft constraints. Burke EK, Causmaecker PD, eds. Practice and Theory of Automated Timetabling IV, Selected Revised Papers, Lecture Notes in Computer Science, Vol. 2740 (Springer, Berlin), 310–328.Google Scholar
• Ryvchin V, Strichman O (2011) Faster extraction of high-level minimal unsatisfiable cores. Sakallah KA, Simon L, eds. Theory and Applications of Satisfiability Testing—SAT, Lecture Notes in Computer Science, Vol. 6695 (Springer, Berlin), 174–187.Crossref, Google Scholar
• Strichman O (2016) Scheduling benchmarks page. Accessed May 10, 2017, http://ie.technion.ac.il/~ofers/TieSched/.Google Scholar
• Thompson JM, Dowsland KA (1996) Variants of simulated annealing for the examination timetabling problem. Ann. Oper. Res. 63(1–4):105–128.Crossref, Google Scholar
• Veksler M, Strichman O (2015) Learning general constraints in CSP. Accessed May 10, 2017, https://pdfs.semanticscholar.org/c118/597b25f85b0a8d98c287f5acb6326169b6c5.pdf.Google Scholar