Bassimir B, Wanka R (2019)
Publication Language: English
Publication Type: Conference contribution, Original article
Publication year: 2019
Pages Range: 381-395
Conference Proceedings Title: Proc. 9th Multidisciplinary International Conference on Scheduling: Theory and Applications
URI: http://www.schedulingconference.org/proceedings/2019/mista2019.pdf
Open Access Link: http://www.schedulingconference.org/proceedings/2019/mista2019.pdf
In the literature the examination timetabling problem (ETTP) is often considered a post-enrollment problem (PE-ETTP). In the real world, universities often schedule their exams before students register using information from previous terms. A direct consequence of this approach is the uncertainty present in the resulting models. In this work we discuss several approaches available in the robust optimization literature. We consider the implications of each approach in respect to the examination timetabling problem and present how the most favorable approaches can be applied to the ETTP. Afterwards we analyze the impact of some possible implementations of the given robustness approaches on two real world instances and several random instances generated by our instance generation framework which we introduce in this work.
APA:
Bassimir, B., & Wanka, R. (2019). Robustness Approaches for the Examination Timetabling Problem under Data Uncertainty. In Ruibin Bai, Zhi-Long Chen, Li Jiawei, Graham Kendall, Barry McCollum (Eds.), Proc. 9th Multidisciplinary International Conference on Scheduling: Theory and Applications (pp. 381-395). Ningbo, CN.
MLA:
Bassimir, Bernd, and Rolf Wanka. "Robustness Approaches for the Examination Timetabling Problem under Data Uncertainty." Proceedings of the 9th Multidisciplinary International Conference on Scheduling: Theory and Applications, Ningbo Ed. Ruibin Bai, Zhi-Long Chen, Li Jiawei, Graham Kendall, Barry McCollum, 2019. 381-395.
BibTeX: Download