An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
type: Item
instance of: scholarly article
title: An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
zbMATH Open document ID: 1251.90149
author: Christos Gogos
author: Panayiotis Alefragis
author: Efthymios Housos
published in: Annals of Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6107410
zbMATH Keywords: metaheuristics
zbMATH Keywords: GRASP
zbMATH Keywords: simulated annealing
zbMATH Keywords: Kempe chains
zbMATH Keywords: integer programming
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: s10479-010-0712-3
OpenAlex ID: W1983380249
cites work: An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
cites work: Scheduling examinations to reduce second-order conflicts
cites work: New methods to color the vertices of a graph
cites work: Final examination scheduling
cites work: Solving examination timetabling problems through adaption of heuristic orderings
cites work: Recent research directions in automated timetabling
cites work: Greedy randomized adaptive search procedures
cites work: Q4354785
cites work: Q4252525
cites work: Q2779822
cites work: A new model for automated examination timetabling
cites work: Setting the research agenda in automated timetabling: the second international timetabling competition
cites work: A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
cites work: Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
cites work: A survey of search methodologies and automated system development for examination timetabling
cites work: Variants of simulated annealing for the examination timetabling problem
cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems
DOI: 10.1007/S10479-010-0712-3
description: scientific article; zbMATH DE number 6107410