Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Investigating Ahuja–Orlin’s large neighbourhood search approach for examination timetabling

16 references·16 citing·14 second hopsampled

FromToDepth

this work references cited by second hop· second hop is a sample of the most-cited connections

References

1999A Survey of Automated Timetabling654 cited
1985An introduction to timetabling581 cited
2003A Tabu-Search Hyperheuristic for Timetabling and Rostering509 cited
2002Recent research directions in automated timetabling433 cited
1996Examination Timetabling: Algorithmic Strategies and Applications378 cited
1996A memetic algorithm for university exam timetabling244 cited
1986OR Practice—A Survey of Practical Applications of Examination Timetabling Algorithms229 cited
2006Case-based heuristic selection for timetabling problems223 cited
2014The practice and theory of automated timetabling208 cited
2004A time-predefined local search approach to exam timetabling problems198 cited
1998A robust simulated annealing based examination timetabling system196 cited
2003A Hybrid Algorithm for the Examination Timetabling Problem192 cited
1997Automated University Timetabling: The State of the Art190 cited
1999A multistage evolutionary algorithm for the timetable problem188 cited
1996Recent developments in practical examination timetabling186 cited
2001

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

Tabu Search Techniques for Examination Timetabling

172 cited

Cited by

2009Evolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework81 cited
2012On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems80 cited
2009Decomposition, reformulation, and diving in university course timetabling80 cited
2011An integrated hybrid approach to the examination timetabling problem74 cited
2009Examination timetabling using late acceptance hyper-heuristics71 cited
2014Hybrid bee colony optimization for examination timetabling problems63 cited
2006A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem60 cited
2011A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice54 cited
2016Adaptive large neighborhood search for the curriculum-based course timetabling problem49 cited
2013An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling47 cited
2015A Hybrid Swarm-Based Approach to University Timetabling46 cited
2012A Time Predefined Variable Depth Search for Nurse Rostering46 cited
2013Memetic techniques for examination timetabling45 cited
2013A hybrid self-adaptive bees algorithm for examination timetabling problems43 cited
2014A new hybrid imperialist swarm-based optimization algorithm for university timetabling problems40 cited
2007Very Large-Scale Neighborhood Search Techniques in Timetabling Problems40 cited