A survey of search methodologies and automated system development for examination timetabling

DOI10.1007/s10951-008-0077-5zbMath1279.90071MaRDI QIDQ835639

N. E. Zubov

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: http://eprints.nottingham.ac.uk/28266/

zbMATH Keywords

examination timetabling; benchmark problem datasets; search methodologies

Mathematics Subject Classification ID

90B40: Search theory

90B35: Deterministic scheduling theory in operations research

Related Items

A review of hyper-heuristics for educational timetabling, Effective learning hyper-heuristics for the course timetabling problem, A step counting hill climbing algorithm applied to university examination timetabling, Real-life examination timetabling, Operational research in education, Finding robust timetables for project presentations of student teams, A column generation approach for solving the examination-timetabling problem, Hybrid bee colony optimization for examination timetabling problems, Mathematical models and algorithms for a high school timetabling problem, Genetic based discrete particle swarm optimization for elderly day care center timetabling, Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling, An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling, A constructive approach to examination timetabling based on adaptive decomposition and ordering, Memetic techniques for examination timetabling, Adaptive selection of heuristics for improving exam timetables, The design and implementation of an interactive course-timetabling system, Preprocessing and an improved MIP model for examination timetabling, A multiobjective framework for heavily constrained examination timetabling problems, Term-end exam scheduling at United States Military Academy/West Point, A multi-objective evolutionary algorithm for examination timetabling, Hybrid variable neighbourhood approaches to university exam timetabling, The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution, A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem, Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems, A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems, Monte Carlo hyper-heuristics for examination timetabling, A harmony search algorithm for university course timetabling, Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results, Linear combinations of heuristics for examination timetabling, Towards a reference model for timetabling and rostering, Flight gate scheduling with respect to a reference schedule, An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem, A new model for automated examination timetabling, Managing the tabu list length using a fuzzy inference system: an application to examination timetabling, On the performance of scatter search for post-enrolment course timetabling problems, The component model for elementary landscapes and partial neighborhoods, Adaptive linear combination of heuristic orderings in constructing examination timetables, Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling

Uses Software

• Hyperheuristics
• MCS
• EasyLocal++
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving examination timetabling problems through adaption of heuristic orderings
• An introduction to timetabling
• Case-based heuristic selection for timetabling problems
• Hybrid variable neighbourhood approaches to university exam timetabling
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• General local search methods
• Restricted coloring models for timetabling
• Variable neighborhood search
• Planning of high school examinations in Denmark
• A robust simulated annealing based examination timetabling system.
• Using tabu search with longer-term memory and relaxation to create examination timetables.
• Recent research directions in automated timetabling
• Complexity of some special types of timetabling problems
• Hybrid heuristics for examination timetabling problem
• Constraint satisfaction problems: Algorithms and applications
• Comparison of metaheuristic algorithms for examination timetabling problem
• Variants of simulated annealing for the examination timetabling problem
• Metaheuristics: A bibliography
• MCS---a new algorithm for multicriteria optimisation in constraint programming
• A graph-based hyper-heuristic for educational timetabling problems
• Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
• The state of the art of nurse rostering
• A survey of metaheuristic-based techniques for university timetabling problems
• Ant colony optimization theory: a survey
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
• Novel Local-Search-Based Approaches to University Examination Timetabling
• Constraint logic programming for examination timetabling
• Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
• Search Methodologies
• Parallel Tabu Search
• A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
• New methods to color the vertices of a graph
• Bandwidth Packing: A Tabu Search Approach
• Ants can colour graphs
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• Extended clique initialisation in examination timetabling
• Ant colony optimization for the examination scheduling problem
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• A system for computing university examination timetables
• Final examination scheduling
• Handbook of metaheuristics
• Implementation of a university course and examination timetabling system
• Variable neighborhood search: Principles and applications
• Practice and theory of automated timetabling III. 3rd international conference, PATAT 2000, Konstanz, Germany, August 16--18, 2000. Selected papers
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem