Novel Local-Search-Based Approaches to University Examination Timetabling

References

• Asmuni H., Burke E. K., Garibaldi J. M., Burke E. K., Trick M. Fuzzy multiple ordering criteria for examination timetabling. Practice and Theory of Automated Timetabling V. Lecture Notes in Computer Science (2005) 3616(Springer, Berlin) 334–353Crossref, Google Scholar
• Burke E. K., Newall J. P. A multi-stage evolutionary algorithm for the timetabling problem. IEEE Trans. Evolutionary Comput. (1999) 3:63–74Crossref, Google Scholar
• Burke E. K., Newall J. P., Burke E. K., De Causmaecker P. Enhancing timetable solutions with local search methods. Practice and Theory of Automated Timetabling IV. Lecture Notes in Computer Science (2003) 2740(Springer, Berlin) 195–206Crossref, Google Scholar
• Burke E. K., Newall J. P. Solving examination timetabling problems through adaptation of heuristic orderings. Ann. Oper. Res. (2004) 129:107–134Crossref, Google Scholar
• Burke E. K., Kingston J. H., De Werra D., Gross J., Yellen J. Applications to timetabling. Handbook of Graph Theory (2004a) (Chapman Hall/CRC Press, Boca Raton, FL) 445–474Google Scholar
• Burke E. K., Bykov Y., Newall J. P., Petrovic S. A time-predefined local search approach to exam timetabling problems. IIE Trans. (2004b) 36:509–528Crossref, Google Scholar
• Burke E. K., Newall J. P., Weare R. F., Burke E. K., Ross P. A memetic algorithm for university exam timetabling. Practice and Theory of Automated Timetabling I. Lecture Notes in Computer Science (1996a) 1153(Springer, Berlin) 241–250Crossref, Google Scholar
• Burke E. K., Elliman D. G., Ford P. H., Weare R. F., Burke E. K., Ross P. Examination timetabling in British universities—A survey. Practice and Theory of Automated Timetabling I. Lecture Notes in Computer Science (1996b) 1153(Springer, Berlin) 76–92Crossref, Google Scholar
• Caramia M., Dell'Olmo P., Italiano G. F., Naher S., Wagner D. New algorithms for examination timetabling. Algorithm Engrg. 4th Internat. Workshop. Lecture Notes in Computer Science (2001) 1982(Springer, Berlin) 230–241Crossref, Google Scholar
• Carter M. W., Laporte G., Burke E. K., Ross P. Recent developments in practical examination timetabling. Practice and Theory of Automated Timetabling I. Lecture Notes in Computer Science (1996) 1153(Springer, Berlin) 3–21Crossref, Google Scholar
• Casey S., Thompson J., Burke E. K., De Causmaecker P. GRASPing the examination scheduling problem. Practice and Theory of Automated Timetabling IV. Lecture Notes in Computer Science (2003) 2740(Springer, Berlin) 232–244Crossref, Google Scholar
• Cote P., Wang T., Sabourin R., Burke E. K., Trick M. Application of a hybrid multi-objective evolutionary algorithm to the uncapacitated exam proximity problem. Practice and Theory of Automated Timetabling V. Lecture Notes in Computer Science (2005) 3616(Springer, Berlin) 294–312Crossref, Google Scholar
• Di Gaspero L., Schaerf A., Burke E. K., Erben W. Tabu search techniques for examination timetabling problems. Practice and Theory of Automated Timetabling III. Lecture Notes in Computer Science (2001) 2079(Springer, Berlin) 104–117Crossref, Google Scholar
• Glover F., Laguna M., Gonzales-Valarde J. L. Multi-start and strategic oscillation methods principles to exploit adaptive memory. Computing Tools for Modelling Optimization and Simulation: Interfaces in Computer Science and Operations Research (2000) (Kluwer Academic Publishers, Amsterdam) 1–24Crossref, Google Scholar
• Hart J. P., Shogan A. W. Semi-greedy heuristics: An empirical study. Oper. Res. Lett. (1987) 6:107–114Crossref, Google Scholar
• Kendall G., Mohd Hussin N., Kendall G., Burke E. K., Petrovic S., Gendreau M. An investigation of a tabu search based hyper-heuristic for examination timetabling. Multi-Disciplinary Scheduling: Theory and Applications (2005) (Springer, Berlin) 309–328Crossref, Google Scholar
• Merlot L. T. G., Boland N., Hughes B. D., Stuckey P. J., Burke E. K., De Causmaecker P. A hybrid algorithm for the examination timetabling problem. Practice and Theory of Automated Timetabling IV. Lecture Notes in Computer Science (2003) 2740(Springer, Berlin) 207–231Crossref, Google Scholar
• Petrovic S., Burke E. K., Leung J. University timetabling. Handbook of Scheduling (2004) (Chapman Hall/CRC Press, Boca Raton, FL) . Chap. 45Google Scholar
• Petrovic S., Yang Y., Dror M., Kendall G., Burke E. K., Petrovic S., Gendreau M. Case-based initialisation of metaheuristics for examination timetabling. Multi-disciplinary Scheduling: Theory and Applications (2003) (Springer, Berlin) 289–308Google Scholar
• Resende M. G. C., Ribeiro C. C., Glover F., Kochenberger G. Greedy randomized adaptive search procedures. Handbook in Metaheuristics (2002) (Kluwer Academic Publishers, Amsterdam) 219–249Google Scholar
• Thompson J. M., Dowsland K. A. A robust simulated annealing based examination timetabling system. Comput. Oper. Res. (1998) 25:637–648Crossref, Google Scholar
• White G. M., Xie B. S., Burke E. K., Erben W. Examination timetables and tabu search with longer-term memory. Practice and Theory of Automated Timetabling III. Lecture Notes in Computer Science (2001) 2079(Springer, Berlin) 85–103Crossref, Google Scholar
• Yang Y., Petrovic S., Burke E. K., Trick M. A novel similarity measure for heuristic selection in examination timetabling. Practice and Theory of Automated Timetabling V. Lecture Notes in Computer Science (2005) 3616(Springer, Berlin) 247–269Crossref, Google Scholar