An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem

DOI10.1007/s10479-010-0712-3zbMath1251.90149OpenAlexW1983380249MaRDI QIDQ1761902

Christos Gogos, Efthymios Housos, Panayiotis Alefragis

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0712-3

zbMATH Keywords

integer programmingmetaheuristicssimulated annealingGRASPKempe chains

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (18)

Real-life examination timetabling ⋮ A column generation approach for solving the examination-timetabling problem ⋮ A cellular memetic algorithm for the examination timetabling problem ⋮ Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling ⋮ An ILP based heuristic for a generalization of the post-enrollment course timetabling problem ⋮ Feature-based tuning of single-stage simulated annealing for examination timetabling ⋮ An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling ⋮ An integer programming approach to curriculum-based examination timetabling ⋮ An Adaptive Flex-Deluge Approach to University Exam Timetabling ⋮ Memetic techniques for examination timetabling ⋮ Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems ⋮ Solving the examination timetabling problem in GPUs ⋮ Preprocessing and an improved MIP model for examination timetabling ⋮ Monte Carlo hyper-heuristics for examination timetabling ⋮ An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem ⋮ A new model for automated examination timetabling ⋮ The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution ⋮ Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving examination timetabling problems through adaption of heuristic orderings
• A survey of search methodologies and automated system development for examination timetabling
• An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
• A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
• Scheduling examinations to reduce second-order conflicts
• Recent research directions in automated timetabling
• An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
• A new model for automated examination timetabling
• Greedy randomized adaptive search procedures
• Variants of simulated annealing for the examination timetabling problem
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
• Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
• New methods to color the vertices of a graph
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Final examination scheduling

This page was built for publication: An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem