65
Views
41
CrossRef citations to date
0
Altmetric
Case-Oriented Paper

A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem

, , , &
Pages 1494-1502 | Received 01 Oct 2004, Accepted 01 May 2006, Published online: 21 Dec 2017

References

  • Abdullah S, Ahmadi S, Burke EK and Dror M (2006). Investigating Ahuja–Orlin's large neighbourhood search approach for examination timetabling. Accepted for publication in OR Spectrum 2006, to appear.
  • AhujaRKErgunOOrlinJBPunnenAOA survey of very large-scale neighbourhood search techniquesDiscrete Appl Math20021237510210.1016/S0166-218X(01)00338-9
  • AhujaRKMagnantiTLOrlinJBNetwork Flows: Theory, Algorithms, and Applications1993
  • AhujaRKOrlinJBSharmaDVery large scale neighbourhood searchInt Trans Opns Res2000730231710.1111/j.1475-3995.2000.tb00201.x
  • AhujaRKOrlinJBSharmaDMultiexchange neighbourhood search algorithm for capacitated minimum spanning tree problemMath Programm2001917197
  • AhujaRKOrlinJBSharmaDA composite very large-scale neighborhood structure for the capacitated minimum spanning tree problemOpns Res Lett20033118519410.1016/S0167-6377(02)00236-5
  • AyobMKendallGA Monte Carlo hyper-heuristic to optimise component placement sequencing for multi head placement machineProceedings of the International Conference on Intelligent Technologies, InTech'03, Chiang Mai, Thailand2003132141
  • BardadymVAComputer-aided school and university timetabling: the new waveThe Practice and Theory of Automated Timetabling19962245
  • BurkeEKBykovYNewallJPPetrovicSA time-predefined local search approach to exam timetabling problemIIE Transactions20043650952810.1080/07408170490438410
  • BurkeEKNewallJPWeareRFA memetic algorithm for university exam timetablingThe Practice and Theory of Automated Timetabling1996241250
  • BurkeEKEllimanDFordPWeareRFExamination timetabling in British universities—a surveyThe Practice and Theory of Automated Timetabling19967692
  • BurkeEKJacksonKSKingstonJHWeareRFAutomated university timetabling: the state of the artComput J19974056557110.1093/comjnl/40.9.565
  • BurkeEKPetrovicSRecent research directions in automated timetablingEur J Opl Res200214026628010.1016/S0377-2217(02)00069-3
  • BurkeEKKendallGSoubeigaEA Tabu-Search Hyperheuristic for Timetabling and RosteringJournal of Heuristics2003945147010.1023/B:HEUR.0000012446.94732.b6
  • BurkeEKHartEKendallGNewallJPRossPSchulenburgSHandbook of Metaheuristics2003457474
  • CaramiaMDell'OlmoPItalianoGFNew algorithms for examination timetablingAlgorithm Engineering, 4th International Workshop Proceedings WAE 2000, Saarbrucken Germany2001230241
  • CarterMWA survey of practical applications of examination timetablingOpns Res19863419320210.1287/opre.34.2.193
  • CarterMWLaporteGRecent developments in practical examination timetablingThe Practice and Theory of Automated Timetabling1996321
  • CarterMWLaporteGLeeSYExamination timetabling: algorithmic strategies and applicationsJ Opl Res Soc19967437338310.1057/jors.1996.37
  • de WerraDAn introduction to timetablingEur J Opl Res19851915116210.1016/0377-2217(85)90167-5
  • Di GasperoLSchaerfATabu search techniques for examination timetablingThe Practice and Theory of Automated Timetabling2001104117
  • DowslandKAOff-the-peg or made-to measure? Timetabling and scheduling with SA and TSThe Practice and Theory of Automated Timetabling20013752
  • GendreauMPotvinJTabu searchSearch Methodologies: Introductory Tutorials in Optimisation and Decision Support Techniques2005165186
  • Glover F . (1986). Future paths for integer programming and links to artificial intelligence. Comput Opl Res 13: 533–549.
  • GloverFLagunaMTabu Search1997
  • Kendall G and Hussin N (2005a). An investigation of a tabu search based hyper-heuristic for examination timetabling. In: Kendall G, Burke EK, Petrovic S and Gendreau M (eds). Multidisciplinary Scheduling: Theory and Applications. Springer Verlag, USA, pp 309–328.
  • KendallGHussinNThe Practice and Theory of Automated Timetabling2005270293
  • MerlotLTGBolandNHughesBDStuckeyPJA hybrid algorithm for the examination timetabling problemThe Practice and Theory of Automated Timetabling2003207231
  • PetrovicSBurkeEKUniversity timetablingHandbook of Scheduling: Algorithms, Models, and Performance Analysis200445.145.23
  • SchaerfALocal search techniques for high-school timetabling problemsIEEE Trans Systems, Man, Cyberne19992936837710.1109/3468.769755
  • SchaerfAA survey of automated timetablingArtif Intelli Rev1999138712710.1023/A:1006576209967
  • ThompsonPMOrlinJBThe theory of cyclic transfer1989
  • ThompsonPMPsaraftisHNCyclic transfer algorithm for multi-vehicle routing and scheduling problemsOpns Res19934193594610.1287/opre.41.5.935
  • WhiteGMXieBSExamination timetables and tabu search with longer term memoryThe Practice and Theory of Automated Timetabling200085103
  • White, GM, Xie, BS, and Zonjic, S (2004). Using tabu search with longer-term memory and relaxation to create examination timetables. Eur J Opl Res 153: 80–91.
  • WrightMSubcost-guided search—experiments with timetabling problemsJ Heuristics2001725126010.1023/A:1011367031160

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.