Novel Local-Search-Based Approaches to University Examination Timetabling
From MaRDI portal
Publication:2900997
DOI10.1287/ijoc.1070.0220zbMath1243.90222OpenAlexW2169669128MaRDI QIDQ2900997
Paolo Dell'Olmo, Giuseppe F. Italiano, Massimiliano Caramia
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1070.0220
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)
Related Items (16)
A survey of search methodologies and automated system development for examination timetabling ⋮ Hybrid bee colony optimization for examination timetabling problems ⋮ Modelling and planning public cultural schedules for efficient use of resources ⋮ A cellular memetic algorithm for the examination timetabling problem ⋮ Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling ⋮ An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling ⋮ An Adaptive Flex-Deluge Approach to University Exam 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 ⋮ Adaptive linear combination of heuristic orderings in constructing examination timetables ⋮ Monte Carlo hyper-heuristics for examination timetabling ⋮ An assignment problem and its application in education domain: a review and potential path ⋮ 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 ⋮ Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy
This page was built for publication: Novel Local-Search-Based Approaches to University Examination Timetabling
