A university-timetabling problem and its solution using Benders’ partitioning—a case study
- 258 Downloads
In this paper, we address a university-timetabling problem and present a methodology that relies on Benders’ partitioning for its solution. This partitioning results from the special nature of the underlying integer programming formulation for this problem. We have used our methodology to schedule courses offered by the College of Engineering as well as to those offered university-wide at Virginia Tech. The results clearly depict an improvement in the quality of course schedules obtained by our methodology over those currently used, when the performance of a timetable is measured by the total distance traveled by the faculty members from their offices in respective departments to the classrooms, where the courses are offered.
Unable to display preview. Download preview PDF.
- Burke, E. K., MacCarthy, B., Petrovic, S., & Qu, R. (2001b). Case based reasoning in course timetabling: An attribute graph approach. Case based reasoning research and development. In Lecture notes in computer science : Vol. 2080. Proceedings of the 4th international conference on case-based reasoning, ICCBR-2001 (pp. 90–104). Berlin: Springer. Google Scholar
- Burke, E. K., MacCathy, B., Petrovic, S., & Qu, R. (2006). Multiple-retrieval cost-based reasoning for course timetabling problem. Journal of the Operational Research Society, 57(2), 148–162. Google Scholar
- Carter, M. W., & Laporte, G. (1998). Recent developments in practical course timetabling. In E. K. Burke & M. W. Carter (Eds.), Lecture notes in computer science : Vol. 1408. Practice and theory of automated timetabling II: Selected papers from the 2nd international conference, Toronto (pp. 3–19). Berlin: Springer. Google Scholar
- Malim, M. R., Khader, T., & Mustafa, A. (2006). Artificial immune algorithms for university timetabling. In E. K. Burke & H. Rudova (Eds.), Practice and theory of automated timetabling (pp. 234–245). Google Scholar
- McCollum, B. (2006). University timetabling: bridging the gap between research and practice. In E. K. Burke & H. Rudova (Eds.), Practice and theory of automated timetabling (pp. 15–35). Google Scholar
- Perzina, R. (2006). Solving the university timetabling problem with optimized enrollment of students by a parallel self-adaptive genetic algorithm. In E. K. Burke & H. Rudova (Eds.), Practice and theory of automated timetabling (pp. 264–280). Google Scholar
- Petrovic, S., & Burke, E. K. (2004). University timetabling. In J. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis. New York: CRC Press. Chap. 45. Google Scholar
- T’kindt, V., & Billaut, J.-C. (2002). Multicriteria scheduling: Theory, models and algorithms. Berlin: Springer. Google Scholar
- van den Broek, J., Hurkens, C., & Woeginger, G. (2006). Timetabling problems at the TU Eindhoven. In E. K. Burke & H. Rudova (Eds.), Practice and theory of automated timetabling (pp. 141–156). Google Scholar