References
- Asmuni H, Burke EK and Garibaldi J (2005). Fuzzy multiple ordering criteria for examination timetabling. In: Burke EK and Trick M. (eds). Selected Papers from the 5th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 3616. Springer: Berlin, pp 334–353.
- AbdullahSAhmadiSBurkeEDrorMInvestigating Ahuja-Orlin's large neighbourhood search for examination timetablingOR Spectrum20072935137210.1007/s00291-006-0034-7
- AbdullahSAhmadiSBurkeEKDrorMMcCollumBA tabu based large neighbourhood search methodology for the capacitated examination timetabling problemJ Opl Res Soc2007581494150210.1057/palgrave.jors.2602258
- AbdullahSBurkeEKMcCollumBUsing a randomised iterative improvement algorithm with composite neighborhood structures for university course timetablingMetaheuristics-Progress in Complex Systems Optimization :Computer Science Interfaces Book Series, Springer Operations Research2007153172
- Bardadym VA (1996). Computer-aided school and university timetabling: the new wave. In: Burke EK and Ross P (eds). Practice and Theory of Automated Timetabling, Selected Papers from the 1st International Conference, Springer Lecture Notes in Computer Science, Vol. 1153. Springer: Berlin, pp 22–45.
- Bilgin B, Özcan E and Korkmaz EE (2007). An experimental study on hyper-heuristics and exam scheduling. In: Burke EK and Rudová H (eds). Selected Papers from the 6th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 3867. Springer: Berlin, pp 394–412.
- BrailsfordSCPottsCNSmithBMConstraint satisfaction problems: algorithms and applicationsEur J Opns Res199911955758110.1016/S0377-2217(98)00364-6
- BruckerPKnustSComplex Scheduling2006
- BurkeEKNewallJA multi-stage evolutionary algorithm for the timetabling problemIEEE Trans Evol Comput19993637410.1109/4235.752921
- BurkeEKPetrovicSRecent research directions in automated timetablingEur J Opl Res200214026628010.1016/S0377-2217(02)00069-3
- BurkeEKNewallJSolving examination timetabling problems through adaptation of heuristic orderingsAnn Opns Res200412910713410.1023/B:ANOR.0000030684.30824.08
- Burke E.K. and Kendall G. (eds). Search Methodologies: Introductory Tutorials in Optimisation and Decision Support Techniques. Springer: Berlin.
- BurkeEKJacksonKKingstonJHWeareRAutomated university timetabling: the state of the artComput J19974056557110.1093/comjnl/40.9.565
- BurkeEKHartEKendallGNewallJRossPSchulenburgSHyperheuristics: an emerging direction in modern search technologyHandbook of Meta-Heuristics2003457474
- BurkeEKKendallGSoubeigaEA tabu search hyperheuristic for timetabling and rosteringJ Heuristics2003945147010.1023/B:HEUR.0000012446.94732.b6
- BurkeEBykovYNewallJPetrovicSA time-predefined local search approach to exam timetabling problemsIIE Trans20043650952810.1080/07408170490438410
- Burke EK, De Causmaecker P, Vanden Berghe G and Van Landeghem H (2004b). The state of the art of nurse rostering . J Scheduling(6)441–499.
- BurkeEKKingstonJde WerraDApplications to timetablingHandbook of Graph Theory2004445474
- BurkeEKDrorMPetrovicSQuRHybrid graph heuristics within a hyper-heuristic approach to exam timetabling problemsThe Next Wave in Computing, Optimization and Decision Technologies20057991
- BurkeEKPetrovicSQuRCase based heuristic selection for examination timetablingJ Scheduling2006911513210.1007/s10951-006-6775-y
- BurkeEKMcCollumBMeiselsAPetrovicSQuRA graph-based hyper heuristic for timetabling problemsEur J Opl Res200717617719210.1016/j.ejor.2005.08.012
- Burke EK, Eckersley AJ, McCollum B, Petrovic S and Qu R (2008). Hybrid variable neighbourhood approaches to university exam timetabling. Euro J Opl Res, Forthcoming.
- CaramiaMDell'OlmoPItalianoGFNovel local-search-based approaches to university examination timetablingINFORMS J Comput200820869910.1287/ijoc.1070.0220
- Carter M and Laporte G (1996). Recent developments in practical exam timetabling. In: Burke EK and Ross P (eds). Selected Papers from the 1st International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 1153. Springer: Berlin, pp 3–21.
- Carter M and Laporte G (1998). Recent developments in practical course timetabling. In: Burke EK, and Ross P (eds). Selected Papers from the 2nd International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 1408. Springer, Berlin, pp. 3–19.
- CarterMLaporteGLeeSExamination timetabling: algorithmic strategies and applicationsJ Opl Res Soc19964737338310.1057/jors.1996.37
- Casey S and Thompson J (2003). GRASPing the examination scheduling problem. In: Burke E, Causmaecker P (eds). Selected Papers from the 4th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 2740. Springer: Berlin, pp 232–246.
- Cicirello VA and Smith SF (2004). Heuristic selection for stochastic search optimization: modeling solution quality by extreme value theory. In: Wallace M (ed). Principles and Practice of Constraint Programming CP 2004, Lecture Notes in Computer Science, Vol. 3258 Springer: Berlin, pp 197–211.
- Crowston WB, Glover F, Thompson GL and Trawick JD (1963). Probabilistic and parameter learning combinations of local job shop scheduling rules. ONR Research Memorandum, GSIA, Carnegie Mellon University, Pittsburgh, 117.
- Di Gaspero L, Schaerf A (2001). Tabu search techniques for examination timetabling. In: Burke EK and Erben W (eds). Selected Papers from the 3rd International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 2079. Springer: Berlin, pp 104–117.
- DowslandKSoubeigaEBurkeEKA simulated annealing hyperheuristic for determining shipper sizesEur J Opl Res200717975977410.1016/j.ejor.2005.03.058
- EastonKNemhauserGTrickMSports schedulingHandbook of Scheduling: Algorithms, Models, and Performance Analysis2004
- Eley M (2007). Ant algorithms for the exam timetabling problem. In: Burke EK and Rudova H (eds). Selected Papers from the 6th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 3867. Springer: Berlin, pp 364–382.
- FisherHThompsonGLProbabilistic learning combinations of local job-shop scheduling rulesIndustrial Scheduling1963225251
- Gaw A, Rattadilok P and Kwan RS (2005). Distributed choice function hyperheuristics for timetabling and scheduling. In: Burke EK and Trick M (eds). Selected Papers from the 5th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 3616. Springer: Berlin, pp 51–67.
- GomesCPSelmanBAlgorithm portfoliosArtif Intell20011261–2436210.1016/S0004-3702(00)00081-3
- HansenPMladenovicNVariable neighbourhood search: principles and applicationsEur J Opl Res200113044946710.1016/S0377-2217(00)00100-4
- HansenPMladenovicNVariable neighbourhood searchSearch Methodologies: Introductory Tutorials in Optimisation and Decision Support Techniques2005211238
- KrasnogorNSmithJEA tutorial for competent memetic algorithms: Model taxonomy and design issuesIEEE Trans Evol Comput2005947448810.1109/TEVC.2005.850260
- KrasnogorNAragonAPachecoJMemetic algorithmsMetaheuristics in Neural Networks Learning2006225247
- KwanRBus and train driver schedulingHandbook of Scheduling: Algorithms, Models, and Performance Analysis2004
- LourencoHRMartinOStutzleTIterated local searchHandbook of Metaheuristics2003321353
- McCollum BGC (2007). A perspective on bridging the gap in university timetabling. In: Burke EK and Rudová H (eds). Selected Papers from the 6th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 3867. Springer: Berlin, pp 3–23.
- Merlot L, Boland N, Hughes B and Stuckey P (2002). A hybrid algorithm for the examination timetabling problem. In: Burke E and Causmaecker P (eds). Selected Papers from the 4th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 2740. Springer: Berlin, pp 207–231.
- Meyers C and Orlin JB (2007). Very large-scale neighborhood search techniques. In: Burke EK and Rudova H (eds). Selected Papers from the 6th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 3867. Springer: Berlin, pp 24–39.
- NareyekAChoosing search heuristics by non-stationary reinforcement learningMetaheuristics: Computer Decision-Making2003523544
- NonobeKIbarakiTA tabu search approach to the constraint satisfaction problem as a general problem solverEur J Opl Res199810659962310.1016/S0377-2217(97)00294-4
- PetrovicSBurkeEKUniversity timetablingHandbook of Scheduling: Algorithms, Models, and Performance Analysis2004
- Qu R, Burke EK McCollum B, Merlot LTG and Lee SY (2008). A survey of search methodologies and automated system development for examination timetabling. Accepted by J Scheduling, DOI: 10.1007/s10951-008-10077-5, accepted for publication.
- Reeves C.R. (ed). Modern Heuristic Techniques for Combinatorial Problems. Oxford: Scientific Publications.
- RossPHyper-heuristicsSearch Methodologies: Introductory Tutorials in Optimisation and Decision Support Techsiques2005529556
- Ross P, Marin-Blazquez J and Hart E (2004). Hyper-heuristics applied to class and exam timetabling problems. Proceedings of the 2004 Congress on Evolutionary Computation (CEC 2004). IEEE Press, Portland, USA, pp 1691–1698.
- SchaerfAA survey of automated timetablingArtif Intell Rev1999138712710.1023/A:1006576209967
- Socha K, Knowles J and Sampels M (2002). A max-min ant system for the university course timetabling problem. In: Proceedings of the 3rd International Workshop on Ant Algorithms, Lecture Notes in Computer Science, Vol. 2463. Springer: Berlin, pp 1–13.
- Terashima-Marin H, Ross P, Valenzuela-Rendon M (1999). Evolution of constraint satisfaction strategies in examination timetabling. In: Banzhaf W, Daida JM, Eiben AE, Garzon MH, Horava V, Jakiela MJ and Smith RE (eds). Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida USA. Morgan Kaufmann: San Francisco, CA, pp 635–642.
- ThompsonJDowslandKA robust simulated annealing based examination timetabling systemComput Opl Res19982563764810.1016/S0305-0548(97)00101-9
- de WerraDAn introduction to timetablingEur J Opl Res19851915116210.1016/0377-2217(85)90167-5
- White GM (2000). Constrained satisfaction, not so constrained satisfaction and the timetabling problem. In: Burke EK and Erben W (eds). Proceedings of the 3rd International Conference on the Practice and Theory of Automated Timetabling, keynote. Fachhochschule Konstanz, Germany, pp 32–54.
- WhiteGMXieBSZonjicSUsing tabu search with longer term memory and relaxation to create examination timetablesEur J Opl Res2004153809110.1016/S0377-2217(03)00100-0