A multi-stage IP-based heuristic for class timetabling and trainer rostering
- Publication Type:
- Journal Article
- Annals of Operations Research, 2017, 252 (2), pp. 305 - 333
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is open access.
© 2015, Springer Science+Business Media New York. We consider a timetabling and rostering problem involving periodic retraining of large numbers of employees at an Australian electricity distributor. This problem is different from traditional high school and university timetabling problems studied in the literature in several aspects. We propose a three-stage heuristic consisting of timetable generation, timetable improvement, and trainer rostering. Large-scale integer linear programming models for both the timetabling and the rostering components are proposed, and several unique operational constraints are discussed. We show that this solution approach is able to produce good solutions in practically acceptable time.
Please use this identifier to cite or link to this item: