Timetabling problems at the TU Eindhoven

DOI10.1016/j.ejor.2008.04.038zbMath1176.90421MaRDI QIDQ5902305

Gerhard J. Woeginger, Cor A. J. Hurkens, John van den Broek

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.04.038

zbMATH Keywords

integer programming; NP-completeness; university timetabling; lexicographical optimization; network flow formulation

Mathematics Subject Classification ID

90C10: Integer programming

90C05: Linear programming

Related Items

Integer programming methods for large-scale practical classroom assignment problems, An ILP based heuristic for a generalization of the post-enrollment course timetabling problem, Preference-based assignment of university students to multiple teaching groups, The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution, Applying the threshold accepting metaheuristic to~curriculum based course timetabling, An overview of curriculum-based course timetabling

Uses Software

• CPLEX

Cites Work

• An introduction to timetabling
• A computational study of a cutting plane algorithm for university course timetabling
• Computerised decision aid for timetabling --- a case analysis
• Recent research directions in automated timetabling
• Efficient solutions for a university timetabling problem through integer programming
• On the Complexity of Timetable and Multicommodity Flow Problems
• Implementation of a university course and examination timetabling system
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item