An undergraduate uses OR to improve Final Exam Schedules at her university

Danielle Sienko, Paul Ache III, Yun Lu, Francis Joseph Vasko, Ted Witryk

Abstract


Final examination scheduling is typically a complex problem that impacts students, faculty, and administrators at every university. In this paper, we describe how an undergraduate student, for her senior project at Kutztown University, analysed the final exam schedules at Kutztown University to see if she could improve them. Specifically, she wanted to see if she could reduce student conflicts defined to be a student having three exams scheduled on the same day. The approach that she developed, based on a balanced bin packing algorithm, was very appealing because it could be implemented manually by a staff member of the Registrars office, requiring at most 30 minutes to generate the schedule. Testing this approach using actual data from the Fall 2015 semester resulted in a 42% reduction in student conflicts. This approach, because of its simplicity and intuitive appeal, was widely accepted by the Kutztown University faculty and administrators and is being implemented for the Fall 2016 semester.


Keywords


Final examination scheduling, operational research applications, balanced bin packing algorithm, undergraduate student projects.

Full Text:

PDF

References


Akbulut A. and Yilmaz, G., 2013. University Exam Scheduling System Using Graph Colouring Algorithm and RFID Technology. International Journal of Innovation, Management and Technology, 4(1), pp.66-72.

Mohmad Kahar, M.N. and Kendall, G., 2015. A great deluge algorithm for a real-world examination timetabling problem. Journal of the Operational Research Society, 66(1), pp 116-133.

Zhaohui, F. and Lim, A., 2000. Heuristics for the Exam Scheduling Problem. Proceedings 12th IEEE International Conference On Tools with Artificial Intelligence. pp.172-175.




DOI: https://doi.org/10.21100/msor.v15i1.349

Refbacks

  • There are currently no refbacks.