A multi-stage IP-based heuristic for class timetabling and trainer rostering
From MaRDI portal
Publication:2398428
DOI10.1007/s10479-015-2090-3zbMath1368.90066OpenAlexW2264848918MaRDI QIDQ2398428
Aaron Russell, Yakov Zinder, Han-Yu Gu, Oliver G. Czibula
Publication date: 16 August 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10453/42037
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- A fix-and-optimize heuristic for the high school timetabling problem
- A survey of school timetabling research
- An introduction to timetabling
- The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution
- Application of a real-world university-course timetabling model solved by integer programming
- Optimizing simulated annealing schedules with genetic programming
- Staff scheduling and rostering: a review of applications, methods and models.
- Recent research directions in automated timetabling
- A survey of metaheuristic-based techniques for university timetabling problems
- Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation
- A column generation approach for the timetabling problem of Greek high schools
- A linear algorithm for computing the optimum university timetable
- When Is the Classroom Assignment Problem Hard?
- Timetabling for Greek high schools
- Graph coloring conditions for the existence of solutions to the timetable problem
- A new simulated annealing algorithm
- Implementation of a university course and examination timetabling system
This page was built for publication: A multi-stage IP-based heuristic for class timetabling and trainer rostering
